On connected [k, k+1]-factors in claw-free graphs

	On connected [k, k+1]-factors in claw-free graphs
	Li, GJ ; Zhu, BH ; Chen, CP
刊名	ARS COMBINATORIA
	2002
卷号	62 页码:207-219
ISSN号	0381-7032
英文摘要	It is shown in this paper that every 2-connected claw-free graph containing a k-factor has a connected [k, k + 1] -factor, where k > 2.
WOS研究方向	Mathematics
语种	英语
出版者	CHARLES BABBAGE RES CTR
WOS记录号	WOS:000173922800019
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/17396]
专题	中国科学院数学与系统科学研究院
作者单位	1.Shandong Univ, Dept Math, Jinan 250100, Peoples R China 2.City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China 3.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Li, GJ,Zhu, BH,Chen, CP. On connected [k, k+1]-factors in claw-free graphs[J]. ARS COMBINATORIA,2002,62:207-219.
APA	Li, GJ,Zhu, BH,&Chen, CP.(2002).On connected [k, k+1]-factors in claw-free graphs.ARS COMBINATORIA,62,207-219.
MLA	Li, GJ,et al."On connected [k, k+1]-factors in claw-free graphs".ARS COMBINATORIA 62(2002):207-219.