Degree conditions for Hamiltonicity: counting the number of missing edges

DOI10.1016/j.disc.2005.11.037zbMath1122.05055OpenAlexW1996647345MaRDI QIDQ868355

Ingo Schiermeyer, Richard H. Schelp, Akira Saito, Ralph J. Faudree

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.037

zbMATH Keywords

Hamiltonian graphdegree condition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Closures, cycles, and paths ⋮ Cycles with a chord in dense graphs ⋮ New Ore's type results on hamiltonicity and existence of paths of given length in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New sufficient conditions for cycles in graphs
• A method in graph theory
• A remark on two sufficient conditions for Hamilton cycles
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• Decomposition of Finite Graphs into Open Chains
• Some recent results in hamiltonian graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Degree conditions for Hamiltonicity: counting the number of missing edges