若图G不含有同构于K1.3的导出子图,则称G为一个无爪图.令α和b是两个整数满足2≤α≤b.本文证明了若G是一个含有[α,b]-因子的2-连通无爪图,则G有一个连通的[α,b+1]-因子.
A graph G is called claw-free if G has no induced subgraph isomorphic to K1.3. Let α and b be two integers with 2 ≤α≤ b. In this paper it is proved that if G is a 2-connected claw-free graph containing a [α,b]- factor,then G has a connected [α,b+1]- factor.