CSpace
Cyclability of 3-connected graphs
Harkat-Benhamdine, A; Li, H; Tian, F
2000-07-01
Source PublicationJOURNAL OF GRAPH THEORY
ISSN0364-9024
Volume34Issue:3Pages:191-203
AbstractA subset S of ver tices of a graph G is called cyclable in G if there is in G some cycle containing all the vertices of S. We denote by alpha(S,G) the number of vertices of a maximum independent set of G[S]. We prove that if G is a 3-connected graph or order n and if S is a subset of vertices such that the degree sum of any four independent vertices of S is at least n + 2 alpha(S, G)-2, then S is cyclable. This result implies several known results on cyclability or Hamiltonicity. (C) 2000 John Wiley & Sons, Inc.
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000087574800001
PublisherJOHN WILEY & SONS INC
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/15560
Collection中国科学院数学与系统科学研究院
Corresponding AuthorHarkat-Benhamdine, A
Affiliation1.Univ Paris 11, LRI, URA 410 CNRS, F-91405 Orsay, France
2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
Recommended Citation
GB/T 7714
Harkat-Benhamdine, A,Li, H,Tian, F. Cyclability of 3-connected graphs[J]. JOURNAL OF GRAPH THEORY,2000,34(3):191-203.
APA Harkat-Benhamdine, A,Li, H,&Tian, F.(2000).Cyclability of 3-connected graphs.JOURNAL OF GRAPH THEORY,34(3),191-203.
MLA Harkat-Benhamdine, A,et al."Cyclability of 3-connected graphs".JOURNAL OF GRAPH THEORY 34.3(2000):191-203.
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
[Harkat-Benhamdine, A]'s Articles
[Li, H]'s Articles
[Tian, F]'s Articles
Baidu academic
Similar articles in Baidu academic
[Harkat-Benhamdine, A]'s Articles
[Li, H]'s Articles
[Tian, F]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Harkat-Benhamdine, A]'s Articles
[Li, H]'s Articles
[Tian, F]'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.