Long cycles in graphs without Hamiltonian paths
From MaRDI portal
Publication:998320
DOI10.1016/j.disc.2007.10.049zbMath1229.05176OpenAlexW2009542477MaRDI QIDQ998320
Kenta Ozeki, Tomoki Yamashita, Ken-ichi Kawarabayashi
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.049
Related Items
A degree sum condition for graphs to be covered by two cycles, On relative length of longest paths and cycles
Cites Work
- Unnamed Item
- Relative lengths of paths and cycles in 3-connected graphs
- Longest paths and longest cycles in graphs with large degree sums
- Relative length of longest paths and cycles in graphs
- Relative length of longest paths and cycles in 3-connected graphs
- On relative length of longest paths and cycles
- Relative length of long paths and cycles in graphs with large degree sums