Degree conditions for k‐ordered hamiltonian graphs

DOI10.1002/jgt.10084zbMath1014.05045MaRDI QIDQ4800399

Ralph J. Faudree, Ronald J. Gould, Akira Saito, Linda Lesniak, Alexandr V. Kostochka, Ingo Schiermeyer

Publication date: 3 April 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10084

zbMATH Keywords

Hamiltonian cycle

Mathematics Subject Classification ID

05C45: Eulerian and Hamiltonian graphs

Related Items

Hamiltonian Extension, 2-Trees: Structural insights and the study of Hamiltonian paths, Ramsey-Turán type results for matchings in edge colored graphs, Ramsey number of paths and connected matchings in Ore-type host graphs, A survey on Hamilton cycles in directed graphs, On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem, Generalizing vertex pancyclic and \(k\)-ordered graphs, 4-connected triangulations and 4-orderedness, Set-orderedness as a generalization of \(k\)-orderedness and cyclability, Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture, A fan-type result on \(k\)-ordered graphs, \(k\)-Ordered Hamilton cycles in digraphs, Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian, A look at cycles containing specified elements of a graph, 2-spanning cyclability problems of some generalized Petersen graphs, Minimum degree condition for a graph to be knitted, Degree sum condition for \(k\)-ordered Hamiltonian connected graphs, On low degree \(k\)-ordered graphs, Recent advances on the Hamiltonian problem: survey III, Long cycles containing \(k\)-ordered vertices in graphs, Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles