English

The Cycle Spectrum of Claw-free Hamiltonian Graphs

Combinatorics 2013-12-05 v1

Abstract

If GG is a claw-free hamiltonian graph of order nn and maximum degree Δ\Delta with Δ24\Delta\geq 24, then GG has cycles of at least min{n,32Δ}2\min\left\{ n,\left\lceil\frac{3}{2}\Delta\right\rceil\right\}-2 many different lengths.

Keywords

Cite

@article{arxiv.1312.1106,
  title  = {The Cycle Spectrum of Claw-free Hamiltonian Graphs},
  author = {Jonas Eckert and Felix Joos and Dieter Rautenbach},
  journal= {arXiv preprint arXiv:1312.1106},
  year   = {2013}
}

Comments

9 pages