Survey of results on \(k\)-ordered graphs

DOI10.1016/S0012-365X(00)00202-8zbMath0967.05041WikidataQ105709462 ScholiaQ105709462MaRDI QIDQ5931446

Ralph J. Faudree

Publication date: 27 August 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian graph; \(k\)-ordered graph; \(k\)-ordered Hamiltonian graph

Mathematics Subject Classification ID

05C38: Paths and cycles

05C45: Eulerian and Hamiltonian graphs

Related Items

Connectivity for Kite-Linked Graphs, Cyclability, connectivity and circumference, Every 5-connected planar triangulation is 4-ordered Hamiltonian, Solution to an open problem on 4-ordered Hamiltonian graphs, Pairs of edges as chords and as cut-edges, Generalizing vertex pancyclic and \(k\)-ordered graphs, On 4-ordered 3-regular graphs, 4-connected triangulations and 4-orderedness, Set-orderedness as a generalization of \(k\)-orderedness and cyclability, A fan-type result on \(k\)-ordered graphs, Subdivision extendibility, Graph powers and \(k\)-ordered hamiltonicity, Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian, \(k\)-ordered hamiltonicity of iterated line graphs, On \(k\)-edge-ordered graphs, 2-spanning cyclability problems of some generalized Petersen graphs, 7-connected graphs are 4-ordered, On low degree \(k\)-ordered graphs, On 3-regular 4-ordered graphs, Linkage for the diamond and the path with four vertices