The cycle spectrum of claw-free Hamiltonian graphs
From MaRDI portal
Publication:5964977
DOI10.1007/s00373-015-1530-9zbMath1336.05079arXiv1312.1106OpenAlexW2044366048MaRDI QIDQ5964977
Jonas Eckert, Felix Joos, Dieter Rautenbach
Publication date: 2 March 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1106
Cites Work
- On the cycle spectrum of cubic Hamiltonian graphs
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum
- On the set of cycle lengths in a Hamiltonian graph with a given maximum degree
- Hamilton cycles in claw-heavy graphs
- A cycle structure theorem for Hamiltonian graphs
- Pancyclicity of claw-free Hamiltonian graphs
- Dirac's minimum degree condition restricted to claws
- Claw-free graphs---a survey
- On pancyclism in Hamiltonian graphs
- Cycles in Hamiltonian graphs of prescribed maximum degree
- Pancyclicity in claw-free graphs
- A note on Hamiltonian circuits
- 2‐neighborhoods and hamiltonian conditions
This page was built for publication: The cycle spectrum of claw-free Hamiltonian graphs