Longest cycles in regular 2-connected claw-free graphs Original Research Article

In this paper, we show that every 2-connected, k-regular claw-free graph on n vertices contains a cycle of length at least min 4k−2, n (k⩾8), and this result is best possible.