Connected Factors in 2-connected Claw-free Graphs
Lihua Han · Mathematica Applicata · 2006
A graph G is called claw-free if G has no induced subgraph isomorphic to K 1,3 .Let a and b be two integers with 2≤a≤b.In this paper it is proved that if G is a 2-connected claw-free graph containing a [a,b]-factor,then G has a connected [a,b+1]-factor.