Long cycles passing through a specified edge in 3-connected graphs

CSpace

	Long cycles passing through a specified edge in 3-connected graphs
	Sun, ZR ; Tian, F ; Wei, B
	2001
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	17 期号:3 页码:565-577
摘要	In this paper we prove that if G is a 3-connected noncomplete graph of order n satisfying that the degree sum of any two vertices with distance 2 is not less than m, then either there exists a cycle containing e of length at least min{ n, m} for any edge e of G, or (K-2 boolean OR (K) over bar (m/2-2)) + (K) over bar (n-m/2) subset of or equal to G subset of or equal to K-m/2 + (K) over bar (n-m/2) or (K-2 boolean OR K-1) + lK(m/2-2) subset of or equal to G subset of or equal to K-3 + lK(m/2-2) where l = 2(n - 3)/(m - 4). The result improves a theorem in [3] and a theorem in [4], respectively.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000172951700014
出版者	SPRINGER-VERLAG TOKYO
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/16485
专题	中国科学院数学与系统科学研究院
通讯作者	Sun, ZR
作者单位	1.Nanjing Normal Univ, Dept Math, Nanjing 210097, Peoples R China 2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Sun, ZR,Tian, F,Wei, B. Long cycles passing through a specified edge in 3-connected graphs[J]. GRAPHS AND COMBINATORICS,2001,17(3):565-577.
APA	Sun, ZR,Tian, F,&Wei, B.(2001).Long cycles passing through a specified edge in 3-connected graphs.GRAPHS AND COMBINATORICS,17(3),565-577.
MLA	Sun, ZR,et al."Long cycles passing through a specified edge in 3-connected graphs".GRAPHS AND COMBINATORICS 17.3(2001):565-577.