Title of article :
Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
Author/Authors :
Li، نويسنده , , MingChu and Xiong، نويسنده , , Liming، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Abstract :
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.
Keywords :
circumference , longest cycle , claw-free graph
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
