A NOTE ON CONNECTED FACTORS IN CLAW-FREE GRAPHS  

作　　者：XU Baoguang, LIU Zhenhong (Institute of Systems Science, Chinese Academy of Sciences, Beijing 100080, China) 

出　　处：《Journal of Systems Science & Complexity》2001年第1期91-92,共2页系统科学与复杂性学报（英文版）

基　　金：the National Natural Science Foundation of China.

摘　　要：In this paper it is shown that every connected claw-free graph G contains connected [a, max{a + 2, b}]-factors if it has [a, b]-factors, where a, b are integers and b ≥ a ≥ 1.In this paper it is shown that every connected claw-free graph G contains connected [a, max{a + 2, b}]-factors if it has [a, b]-factors, where a, b are integers and b ≥ a ≥ 1.

关 键 词：CONNECTED FACTOR CLAW-FREE GRAPH [f g]-factor. 

分 类 号：O157.5[理学—数学]