Hamiltonicity, independence number, and pancyclicity
From MaRDI portal
Publication:412232
DOI10.1016/j.ejc.2011.11.002zbMath1239.05106arXiv1104.3334OpenAlexW2041377007MaRDI QIDQ412232
Choongbum Lee, Benjamin Sudakov
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.3334
Related Items
Embedding cycles in finite planes, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
- Unnamed Item
- Pancyclism in Chvátal-Erdős' graphs
- Pancyclicity of Hamiltonian and highly connected graphs
- A note on pancyclism of highly connected graphs
- The Chvátal-Erdös condition for cycles in triangle-free graphs
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- Pancyclic graphs. I
- A note on Hamiltonian circuits
