Connected [a,b]-Factors in 2-Connected Claw-Free Graphs

Jiguo Yu and Guizhen Liu
School of Computer Science, Qufu Normal University,
Shandong 276826,
P.R.China

Abstract    
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 talk we present the following result, and prove it to be best possible in some sense. Let G be a 2-connected claw-free graph containing a [a,b]-factor, then G has a connected [a,b]-factor. The result of Li, Zhu and Chen is generalized.