Title of article
Circumferences and minimum degrees in 3-connected claw-free graphs
Author/Authors
Li، نويسنده , , MingChu and Cui، نويسنده , , Yongrui and Xiong، نويسنده , , Liming and Tian، نويسنده , , Yuan and Jiang، نويسنده , , He and Yuan، نويسنده , , Xu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
8
From page
3580
To page
3587
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
claw-free graph , circumference , minimum degree , 3-connectedness
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598854
Link To Document