Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian (Q968148): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4350166 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Survey of results on \(k\)-ordered graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Onk-ordered graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Degree conditions for <i>k</i>‐ordered hamiltonian graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Onk-ordered Hamiltonian graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient condition for a graph to be Hamiltonian / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: k-ordered Hamiltonian graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved linear edge bound for graph linkages / rank | |||
Normal rank |
Latest revision as of 19:42, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian |
scientific article |
Statements
Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian (English)
0 references
5 May 2010
0 references
degree condition
0 references
distance
0 references
\(k\)-ordered Hamiltonian graphs
0 references