Cycle lengths of Hamiltonian P_-free graphs
From MaRDI portal
Publication:897235
DOI10.1007/S00373-014-1494-1zbMATH Open1328.05102OpenAlexW2416411450MaRDI QIDQ897235FDOQ897235
Authors: Dirk Meierling, Dieter Rautenbach
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1494-1
Recommendations
Cites Work
- On Hamilton's ideals
- Pancyclic graphs. I
- Note on Hamilton Circuits
- New sufficient conditions for cycles in graphs
- A cycle structure theorem for Hamiltonian graphs
- Cycles in Hamiltonian graphs of prescribed maximum degree
- On the cycle spectrum of cubic Hamiltonian graphs
- Cycle spectra of Hamiltonian graphs
- Hamiltonian degree conditions which imply a graph is pancyclic
Cited In (4)
This page was built for publication: Cycle lengths of Hamiltonian \(P_\ell\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897235)