Circumferences and minimum degrees in 3-connected claw-free graphs

AbstractIn this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cycle of length at least min{n,6δ−15}, thereby generalizing several known results