On the structure of the set of cycle lengths in a Hamiltonian graph
From MaRDI portal
Publication:1883261
DOI10.1016/j.disc.2003.11.053zbMath1062.05077OpenAlexW2061081952MaRDI QIDQ1883261
Publication date: 1 October 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.053
Related Items (2)
On the cycle spectrum of cubic Hamiltonian graphs ⋮ Cycles in Hamiltonian graphs of prescribed maximum degree
Cites Work
- Unnamed Item
- Unnamed Item
- On the set of cycle lengths in a Hamiltonian graph with a given maximum degree
- A cycle structure theorem for Hamiltonian graphs
- A method in graph theory
- Another cycle structure theorem for Hamiltonian graphs
- Small cycles in Hamiltonian graphs
- On pancyclism in Hamiltonian graphs
- Pancyclism and small cycles in graphs
- Weakly pancyclic graphs
This page was built for publication: On the structure of the set of cycle lengths in a Hamiltonian graph