Title of article
2-factors and independent sets on claw-free graphs
Author/Authors
Ku?el، نويسنده , , Roman and Ozeki، نويسنده , , Kenta and Yoshimoto، نويسنده , , Kiyoshi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
5
From page
202
To page
206
Abstract
In this paper, we show that if G is an l -connected claw-free graph with minimum degree at least three and l ∈ { 2 , 3 } , then for any maximum independent set S , there exists a 2-factor in which each cycle contains at least l − 1 vertices in S .
Keywords
Maximum independent set , Ryjacek closure , claw-free graph , 2-factor , Line graph
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1599793
Link To Document