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

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