Hamiltonian cycles with all small even chords
From MaRDI portal
Publication:409469
DOI10.1016/J.DISC.2011.12.013zbMATH Open1239.05103OpenAlexW2060106501MaRDI QIDQ409469FDOQ409469
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
Recommendations
Cites Work
- Proof of the Seymour conjecture for large graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Note on Hamilton Circuits
- Title not available (Why is that?)
- Some Theorems on Abstract Graphs
- Blow-up lemma
- On a problem of K. Zarankiewicz
- Title not available (Why is that?)
- Title not available (Why is that?)
- The square of paths and cycles
- On the square of a Hamiltonian cycle in dense graphs
- Pósa's conjecture for graphs of order at least 2 × 108
- Proof of the bandwidth conjecture of Bollobás and Komlós
- On circuits in graphs
- Embedding Arbitrary Graphs of Maximum Degree Two
- Advances on the Hamiltonian problem -- a survey
- 2-factors in dense bipartite graphs
- 2-factors in dense graphs
- Title not available (Why is that?)
- The Blow-up Lemma
Cited In (2)
This page was built for publication: Hamiltonian cycles with all small even chords
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409469)