Hamiltonian cycles in 3-connected Claw-free graphs

CSpace

	Hamiltonian cycles in 3-connected Claw-free graphs
	Li, GJ ; Lu, M ; Liu, Z
	2002-05-06
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	250 期号:1-3 页码:137-151
摘要	It is shown that every 3-connected claw-free graph having at most 6delta - 7 vertices is hamiltonian. where delta is the minimum degree. (C) 2002 Elsevier Science B.V. All rights reserved.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000175871600010
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/16918
专题	中国科学院数学与系统科学研究院
通讯作者	Li, GJ
作者单位	1.Shandong Univ, Dept Math, Jinan 250100, Peoples R China 2.Tsing Hua Univ, Dept Math, Beijing, Peoples R China 3.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Li, GJ,Lu, M,Liu, Z. Hamiltonian cycles in 3-connected Claw-free graphs[J]. DISCRETE MATHEMATICS,2002,250(1-3):137-151.
APA	Li, GJ,Lu, M,&Liu, Z.(2002).Hamiltonian cycles in 3-connected Claw-free graphs.DISCRETE MATHEMATICS,250(1-3),137-151.
MLA	Li, GJ,et al."Hamiltonian cycles in 3-connected Claw-free graphs".DISCRETE MATHEMATICS 250.1-3(2002):137-151.