An improved degree based condition for Hamiltonian cycles
From MaRDI portal
Publication:845978
DOI10.1016/j.ipl.2006.11.013zbMath1185.05096MaRDI QIDQ845978
Lenin Mehedy, Mohammad Kaykobad, Md. Kamrul Hasan
Publication date: 29 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.11.013
68R10: Graph theory (including graph drawing) in computer science
05C45: Eulerian and Hamiltonian graphs
Related Items
On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem, A comprehensive analysis of degree based condition for Hamiltonian cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new sufficient condition for hamiltonicity of graphs
- On Hamiltonian cycles and Hamiltonian paths
- One criterion of existence of a Hamiltonian cycle
- Advances on the Hamiltonian problem -- a survey
- A lower bound on the number of hamiltonian cycles
- Note on Hamilton Circuits
- Spanning 2‐trails from degree sum conditions