Hamilton cycles in 1-tough triangle-free graphs

CSpace

	Hamilton cycles in 1-tough triangle-free graphs
	Li, XW ; Wei, B ; Yu, ZG ; Zhu, YJ
	2002-06-10
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	254 期号:1-3 页码:275-287
摘要	A graph G is called triangle-free if G has no induced K-3 as a subgraph. We set sigma(3) = min{Sigma(i=l)(3), d(v(i))\{v(1),v(2),v(3)} is an independent set of vertices in G}. In this paper, we show that if G is a 1-tough and triangle-free graph of order n with n less than or equal to sigma(3) then G is hamiltonian. (C) 2002 Elsevier Science B.V. All rights reserved.
关键词	triangle-free 1-tough Hamiltonian graph
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000176452200019
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17912
专题	中国科学院数学与系统科学研究院
通讯作者	Wei, B
作者单位	1.Huazhong Normal Univ, Dept Math, Wuhan 430070, Peoples R China 2.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China 3.Tsing Hua Univ, Dept Appl Math, Beijing 100084, Peoples R China 4.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Li, XW,Wei, B,Yu, ZG,et al. Hamilton cycles in 1-tough triangle-free graphs[J]. DISCRETE MATHEMATICS,2002,254(1-3):275-287.
APA	Li, XW,Wei, B,Yu, ZG,&Zhu, YJ.(2002).Hamilton cycles in 1-tough triangle-free graphs.DISCRETE MATHEMATICS,254(1-3),275-287.
MLA	Li, XW,et al."Hamilton cycles in 1-tough triangle-free graphs".DISCRETE MATHEMATICS 254.1-3(2002):275-287.