Fan-type theorem for long cycles containing a specified edge

doi:10.1007/s00373-005-0622-3

CSpace

	Fan-type theorem for long cycles containing a specified edge
	Lu, M ; Liu, HQ ; Tian, F
	2005-12-01
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	21 期号:4 页码:489-501
摘要	In this paper, we prove that if G is 3-connected noncomplete graph of order n satisfying min{max{d(u),d(v)}:d(u,v)=2}=mu, then for each edge e, G has a cycle containing e of length at least min{n,2 mu}, unless G is a spanning subgraph of K-mu + K-n-mu(c) or K-3+(lK(mu-2) boolean OR K-s), where n=l(mu-2)+s+3,1 <= s <= mu-2.
关键词	cycle specified edge complete subgraph
DOI	10.1007/s00373-005-0622-3
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000235058300011
出版者	SPRINGER TOKYO
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/1376
专题	中国科学院数学与系统科学研究院
通讯作者	Lu, M
作者单位	1.Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China 2.Nankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China 3.Nankai Univ, LPMC, Tianjin 300071, Peoples R China 4.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Lu, M,Liu, HQ,Tian, F. Fan-type theorem for long cycles containing a specified edge[J]. GRAPHS AND COMBINATORICS,2005,21(4):489-501.
APA	Lu, M,Liu, HQ,&Tian, F.(2005).Fan-type theorem for long cycles containing a specified edge.GRAPHS AND COMBINATORICS,21(4),489-501.
MLA	Lu, M,et al."Fan-type theorem for long cycles containing a specified edge".GRAPHS AND COMBINATORICS 21.4(2005):489-501.