The Cycle Spectrum of Claw-free Hamiltonian Graphs
Combinatorics
2013-12-05 v1
Abstract
If is a claw-free hamiltonian graph of order and maximum degree with , then has cycles of at least many different lengths.
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