The Cycle Spectrum of Claw-free Hamiltonian Graphs
classification
🧮 math.CO
keywords
deltaclaw-freehamiltonianleftrightcyclecyclesdegree
read the original abstract
If $G$ is a claw-free hamiltonian graph of order $n$ and maximum degree $\Delta$ with $\Delta\geq 24$, then $G$ has cycles of at least $\min\left\{ n,\left\lceil\frac{3}{2}\Delta\right\rceil\right\}-2$ many different lengths.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.