Degree conditions for k‐ordered hamiltonian graphs

DOI10.1002/JGT.10084MaRDI QIDQ4800399zbMATH OpenOpenAlexFDO

Authors Ralph Faudree, Ronald Gould, Linda Lesniak, Akira Saito, Alexandr 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

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
• scientific article; zbMATH DE number 6438400
• A degree condition for Hamiltonian digraphs
• scientific article; zbMATH DE number 5036076
• Onk-ordered Hamiltonian graphs
• k-ordered Hamiltonian graphs
• Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
• Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
• scientific article; zbMATH DE number 1535434
• Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs

Cited in

(31)

• Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
• 2-Trees: Structural insights and the study of Hamiltonian paths
• Ramsey number of paths and connected matchings in Ore-type host graphs
• Hamiltonian extension
• Minimum degree condition for a graph to be knitted
• Ramsey-Turán type results for matchings in edge colored graphs
• Recent advances on the Hamiltonian problem: survey III
• scientific article; zbMATH DE number 6438400 (Why is no real title available?)
• Set-orderedness as a generalization of \(k\)-orderedness and cyclability
• \(k\)-Ordered Hamilton cycles in digraphs
• A degree condition for Hamiltonian digraphs
• On low degree \(k\)-ordered graphs
• A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
• scientific article; zbMATH DE number 5036076 (Why is no real title available?)
• A study on thek-ordered hamiltonian graphs
• On \(k\)-ordered graphs involved degree sum
• A look at cycles containing specified elements of a graph
• 4-connected triangulations and 4-orderedness
• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
• Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's conjecture
• A survey on Hamilton cycles in directed graphs
• A fan-type result on \(k\)-ordered graphs
• Hamiltonian cycles containing ordered linear forests
• Long cycles containing k-ordered vertices in graphs
• Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles
• 2-spanning cyclability problems of some generalized Petersen graphs
• Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
• The number of Hamiltonian decompositions of regular graphs
• Generalizing vertex pancyclic and \(k\)-ordered graphs
• Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
• Linear forests and ordered cycles

This page was built for publication: Degree conditions for k‐ordered hamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4800399)