CSpace
On the circumferences of regular 2-connected graphs
Bing, W
1999
Source PublicationJOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN0095-8956
Volume75Issue:1Pages:88-99
AbstractLet 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.
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000078082100007
PublisherACADEMIC PRESS INC
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/14583
Collection中国科学院数学与系统科学研究院
AffiliationAcad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Bing, W]'s Articles
Baidu academic
Similar articles in Baidu academic
[Bing, W]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Bing, W]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.