应用数学2006，Vol.19Issue(1)：169-175,7.
2-连通无爪图的连通因子
Connected Factors in 2-connected Claw-free Graphs
摘要
Abstract
A graph G is called claw-free if G has no induced subgraph isomorphic to K1,3. Let a and b be two integers with 2 ≤ a ≤ b. In this paper it is proved that if Gis a 2-connected claw-free graph containing a [a ,b]- factor, then G has a connected [a ,b + 1]- factor.关键词
图/连通因子/无爪图Key words
Graph/Connected factor/Claw-free graph分类
数理科学引用本文复制引用
禹继国,刘桂真,卞秋菊,韩丽花..2-连通无爪图的连通因子[J].应用数学,2006,19(1):169-175,7.基金项目
Supported by NSF of China (10471048), RFDP (20040422004) of Higher Education and DRF of QFNU, Promotional Foundation ( 2005 BS01016 ) for Excellent Mid-aged or Young Scientists of Shandong Province （10471048）
