Long cycles in Hamiltonian graphs

DOI10.1007/s11856-018-1798-6zbMath1404.05106arXiv1709.04895OpenAlexW2963537887MaRDI QIDQ1717607

António Girão, Teeradej Kittipassorn, Bhargav P. Narayanan

Publication date: 7 February 2019

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.04895

zbMATH Keywords

Hamiltonian cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Regular Graphs with Few Longest Cycles ⋮ Cycles of many lengths in Hamiltonian graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Spanning cycles of nearly cubic graphs
• The complexity of finding a second Hamiltonian cycle in cubic graphs
• On the complexity of the parity argument and other inefficient proofs of existence
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Chords of longest cycles in cubic graphs
• Advances on the Hamiltonian problem -- a survey
• Vertices of small degree in uniquely Hamiltonian graphs
• Beautiful conjectures in graph theory
• A decomposition theorem for partially ordered sets
• On the Number of Hamiltonian Cycles in Bipartite Graphs
• Uniquely Hamiltonian Graphs of Minimum Degree 4
• Extremal problems for cycles in graphs
• Unavoidable cycle lengths in graphs
• A note concerning graphs with unique f-factors
• Independent dominating sets and hamiltonian cycles
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• On Hamiltonian Circuits

This page was built for publication: Long cycles in Hamiltonian graphs