The Cycle Spectrum of Claw-free Hamiltonian Graphs
Abstract
If G is a claw-free hamiltonian graph of order n and maximum degree with ≥ 24, then G has cycles of at least \ n,32\-2 many different lengths.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.