Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

In this paper, we prove that every 3-connected claw-free graph on n vertices contain a cycle of length at least min{n,6δ−17}, hereby improving several known results.