Degree-light-free graphs and Hamiltonian cycles

CSpace

	Degree-light-free graphs and Hamiltonian cycles
	Chen, GT ; Wei, B ; Zhang, XR
	2001
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	17 期号:3 页码:409-434
摘要	Let G and H be graphs. G is said to be degree-light H-Free if G is either H-free or, for every induced subgraph K of G with K congruent to H, and every {u, upsilon} subset of or equal to K, dist(K) (u, upsilon) = 2 implies max{d(u), d(upsilon)} greater than or equal to \V(G)\ /2. In this paper, we will show that every 2-connected graph with either degree-light {K-1,K-3, P-6}-free or degree-light {K-1,K-3, Z}-free is hamiltonian (with three exceptional graphs), where P-6 is a path of order 6 and Z is obtained from P-6 by adding an edge between the first and the third vertex of P6 (see Figure 1).
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000172951700002
出版者	SPRINGER-VERLAG TOKYO
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/16756
专题	中国科学院数学与系统科学研究院
通讯作者	Chen, GT
作者单位	1.Georgia State Univ, Dept Math & Stat, Atlanta, GA 30303 USA 2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China 3.Arizona State Univ, Dept Math, Tempe, AZ 85287 USA
推荐引用方式 GB/T 7714	Chen, GT,Wei, B,Zhang, XR. Degree-light-free graphs and Hamiltonian cycles[J]. GRAPHS AND COMBINATORICS,2001,17(3):409-434.
APA	Chen, GT,Wei, B,&Zhang, XR.(2001).Degree-light-free graphs and Hamiltonian cycles.GRAPHS AND COMBINATORICS,17(3),409-434.
MLA	Chen, GT,et al."Degree-light-free graphs and Hamiltonian cycles".GRAPHS AND COMBINATORICS 17.3(2001):409-434.