Degree conditions for k‐ordered hamiltonian graphs
From MaRDI portal
Publication:4800399
DOI10.1002/jgt.10084zbMath1014.05045OpenAlexW4237480940MaRDI 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
Related Items (21)
Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ 2-spanning cyclability problems of some generalized Petersen graphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ Ramsey-Turán type results for matchings in edge colored graphs ⋮ On low degree \(k\)-ordered graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem ⋮ Generalizing vertex pancyclic and \(k\)-ordered graphs ⋮ \(k\)-Ordered Hamilton cycles in digraphs ⋮ Long cycles containing \(k\)-ordered vertices in graphs ⋮ Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian ⋮ 4-connected triangulations and 4-orderedness ⋮ Set-orderedness as a generalization of \(k\)-orderedness and cyclability ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles ⋮ Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture ⋮ A fan-type result on \(k\)-ordered graphs ⋮ Minimum degree condition for a graph to be knitted ⋮ A look at cycles containing specified elements of a graph ⋮ Hamiltonian Extension ⋮ Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
This page was built for publication: Degree conditions for k‐ordered hamiltonian graphs
