Author/Authors :
Li، نويسنده , , MingChu and Cui، نويسنده , , Yongrui and Xiong، نويسنده , , Liming and Tian، نويسنده , , Yuan and Jiang، نويسنده , , He and Yuan، نويسنده , , Xu، نويسنده ,
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
