Title of article
On cycle lengths in claw-free graphs with complete closure
Author/Authors
Ryj??ek، نويسنده , , Zden?k and Skupie?، نويسنده , , Zdzis?aw and Vr?na، نويسنده , , Petr، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
5
From page
570
To page
574
Abstract
We show a construction that gives an infinite family of claw-free graphs of connectivity κ = 2 , 3 , 4 , 5 with complete closure and without a cycle of a given fixed length. This construction disproves a conjecture by the first author, A. Saito and R.H. Schelp.
Keywords
Cycle length , Pancyclicity , claw-free graph , Closure
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1599271
Link To Document