@article{52c435906d8a416a9f30add808d0c2a8,
title = "Circumferences and minimum degrees in 3-connected claw-free graphs",
abstract = "In 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.",
keywords = "3-connectedness, Circumference, Claw-free graph, Minimum degree",
author = "Li, {Ming Chu} and Yongrui Cui and Liming Xiong and Yuan Tian and He Jiang and Xu Yuan",
year = "2009",
month = jun,
day = "6",
doi = "10.1016/j.disc.2007.12.062",
language = "English",
volume = "309",
pages = "3580--3587",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier B.V.",
number = "11",
}