Hamiltonian cycles with all small even chords

DOI10.1016/j.disc.2011.12.013zbMath1239.05103OpenAlexW2060106501MaRDI QIDQ409469

Yi Zhao, Katsuhiro Ota, Akira Saito, Guantao Chen

Publication date: 13 April 2012

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

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

zbMATH Keywords

Hamiltonian cycleDirac theoremPosa's conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Distributing pairs of vertices on Hamiltonian cycles ⋮ Locating any two vertices on Hamiltonian cycles in large graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On circuits in graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• Advances on the Hamiltonian problem -- a survey
• 2-factors in dense bipartite graphs
• The square of paths and cycles
• 2-factors in dense graphs
• Note on Hamilton Circuits
• The Blow-up Lemma
• Embedding Arbitrary Graphs of Maximum Degree Two
• On the square of a Hamiltonian cycle in dense graphs
• Pósa's conjecture for graphs of order at least 2 × 10⁸
• Some Theorems on Abstract Graphs
• On a problem of K. Zarankiewicz

This page was built for publication: Hamiltonian cycles with all small even chords