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
Source Publication	DISCRETE MATHEMATICS
ISSN	0012-365X
Volume	250 Issue:1-3 Pages:137-151
Abstract	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.
Language	英语
WOS Research Area	Mathematics
WOS Subject	Mathematics
WOS ID	WOS:000175871600010
Publisher	ELSEVIER SCIENCE BV
Citation statistics	Cited Times:6[WOS] [WOS Record] [Related Records in WOS]
Document Type	期刊论文
Identifier	http://ir.amss.ac.cn/handle/2S8OKBNM/16918
Collection	中国科学院数学与系统科学研究院
Affiliation	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
Recommended Citation 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.

Files in This Item:
There are no files associated with this item.

Related Services

Bookmark

Google Scholar

Similar articles in Bing Scholar

Terms of Use

No data!

Social Bookmark/Share

All comments (0)

No comment.

The comment function is only available to registered usersLog In

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh

中国科学院数学与系统科学研究院机构知识库