On the circumferences of regular 2-connected graphs

CSpace

	On the circumferences of regular 2-connected graphs
	Bing, W
	1999
发表期刊	JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN	0095-8956
卷号	75 期号:1 页码:88-99
摘要	Let G be a 2-connected d-regular graph on rz less than or equal to rd (r greater than or equal to 3) vertices and c(G) denote the circumference of G. Bendy conjectured that c(G) greater than or equal to 2n/(r - 1) if n is large enough. In this paper, we show that c(G) greater than or equal to 2n/(r - 1) + 2(r - 3)/(r - 1) For any integer r greater than or equal to 3. In particular, G is hamiltonian if r = 3. This generalizes a result of Jackson. Examples to show that the bond for c(G) is sharp and that Bendy's conjecture does not hold if r is allowed to take non-integer values are given. (C) 1999 Academic Press.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000078082100007
出版者	ACADEMIC PRESS INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14583
专题	中国科学院数学与系统科学研究院
通讯作者	Bing, W
作者单位	Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Bing, W. On the circumferences of regular 2-connected graphs[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B,1999,75(1):88-99.
APA	Bing, W.(1999).On the circumferences of regular 2-connected graphs.JOURNAL OF COMBINATORIAL THEORY SERIES B,75(1),88-99.
MLA	Bing, W."On the circumferences of regular 2-connected graphs".JOURNAL OF COMBINATORIAL THEORY SERIES B 75.1(1999):88-99.