CSpace
Panconnectivity of locally connected claw-free graphs
Sheng, Y; Tian, F; Wei, B
1999-05-28
Source PublicationDISCRETE MATHEMATICS
ISSN0012-365X
Volume203Issue:1-3Pages:253-260
AbstractLet G be a connected, locally connected, claw-free graph and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S boolean AND {x, y} = 0, then G contains (x, y)-paths of all possible lengths. As a corollary of the result, the following conjecture of Broersma and Veldman is proved: every locally connected, claw-free graph of order at least 4 is panconnected if and only if it is 3-connected. (C) 1999 Elsevier Science B.V. All rights reserved.
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000081017800019
PublisherELSEVIER SCIENCE BV
Citation statistics
Cited Times:7[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/14598
Collection中国科学院数学与系统科学研究院
AffiliationAcad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
Recommended Citation
GB/T 7714
Sheng, Y,Tian, F,Wei, B. Panconnectivity of locally connected claw-free graphs[J]. DISCRETE MATHEMATICS,1999,203(1-3):253-260.
APA Sheng, Y,Tian, F,&Wei, B.(1999).Panconnectivity of locally connected claw-free graphs.DISCRETE MATHEMATICS,203(1-3),253-260.
MLA Sheng, Y,et al."Panconnectivity of locally connected claw-free graphs".DISCRETE MATHEMATICS 203.1-3(1999):253-260.
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
[Sheng, Y]'s Articles
[Tian, F]'s Articles
[Wei, B]'s Articles
Baidu academic
Similar articles in Baidu academic
[Sheng, Y]'s Articles
[Tian, F]'s Articles
[Wei, B]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Sheng, Y]'s Articles
[Tian, F]'s Articles
[Wei, B]'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.