摘要
若图G不含有同构于K1,3的导出子图,则称G为一个无爪图.令a和b是两个整数满足2≤a≤b.本文证明了若G是一个含有[a,b]因子的2连通无爪图,则G有一个连通的[a,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.
出处
《应用数学》
CSCD
北大核心
2006年第1期169-175,共7页
Mathematica Applicata
基金
upportedbyNSFofChina(10471048),RFDP(20040422004)ofHigherEducationandDRFofQFNU,PromotionalFoundation(2005BS01016)forExcellentMidagedorYoungScientistsofShandongProvince
关键词
图
连通因子
无爪图
Graph
Connected factor
Claw-free graph
