A new sufficient condition for hamiltonicity of graphs

DOI10.1016/J.IPL.2006.01.003MaRDI QIDQ844185zbMATH OpenOpenAlexFDO

Authors Rao Li

Publication date 18 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.01.003

zbMATH Keywords

graphsHamiltonian cyclescombinatorial problemsHamiltonian paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 1501699
• A new sufficient condition for Hamiltonian graphs
• A new sufficient condition for hamiltonian graphs
• scientific article; zbMATH DE number 2016765
• scientific article; zbMATH DE number 147626
• New sufficient conditions on Hamiltonicity of graphs
• New sufficient condition for Hamiltonian graphs
• scientific article; zbMATH DE number 1782180
• New sufficient conditions for some Hamiltonian properties of graphs
• A new sufficient condition for a digraph to be Hamiltonian

Cites work

• Graph theory
• On Hamiltonian cycles and Hamiltonian paths
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs

Cited in

(18)

• Degree with neighborhood conditions and highly Hamiltonian graphs
• Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
• Two types of path structures of graphs
• A sufficient condition for pancyclic graphs
• A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
• On one extension of Dirac's theorem on Hamiltonicity
• scientific article; zbMATH DE number 2201267 (Why is no real title available?)
• scientific article; zbMATH DE number 5036076 (Why is no real title available?)
• An improved degree based condition for Hamiltonian cycles
• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
• New necessary and sufficient condition and algorithm for directed hamiltonian graph based on boolean determinant theory
• New sufficient condition for Hamiltonian graphs
• A comprehensive analysis of degree based condition for Hamiltonian cycles
• Normal Eulerian clique-covering and hamiltonicity
• New Ore's type results on hamiltonicity and existence of paths of given length in graphs
• New local conditions for a graph to be Hamiltonian
• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem and its generalization
• An improvement of Bondy's theorem on Hamilton graph condition

This page was built for publication: A new sufficient condition for hamiltonicity of graphs

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