Cyclability in k-connected K1,4-free graphs

被引：1

作者：

Flandrin, Evelyne ^{[1
]}

Gyori, Ervin ^{[2
]}

Li, Hao ^{[1
,3
]}

Shu, Jinlong ^{[4
]}

机构：

[1] Univ Paris 11, CNRS, UMR 8623, Lab Rech Informat, F-91405 Orsay, France

[2] Hungarian Acad Sci, Alfred Renyi Inst Math, H-1364 Budapest, Hungary

[3] Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Peoples R China

[4] E China Normal Univ, Dept Math, Shanghai 200062, Peoples R China

来源：

DISCRETE MATHEMATICS | 2010年 / 310卷 / 20期

关键词：

Cyclability; Subset of vertices; K-1; K-4-free graph; k-connected graph; THEOREM;

D O I：

10.1016/j.disc.2010.04.018

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

It is proved that if G is a k-connected K-1,K-4-free graph and S is a subset of vertices such that k >= 3 and vertical bar S vertical bar <= 2k then G has a cycle containing S. A similar result is obtained when restricting the k-connectivity assumption to the subset S. (c) 2010 Elsevier B.V. All rights reserved.

引用

页码：2735 / 2741

页数：7

共 50 条

[21] Blocks in k-connected graphs
Karpov D.V.
Journal of Mathematical Sciences, 2005, 126 (3) : 1167 - 1181
[22] Hamilton paths in {K1,4, K1,4+e}-free graphs
Lin, Houyuan
Wang, Jianglu
DISCRETE MATHEMATICS, 2008, 308 (18) : 4280 - 4285
[23] Cliques in k-connected graphs
Obraztsova S.A.
Journal of Mathematical Sciences, 2007, 145 (3) : 4975 - 4980
[24] Testing bandwidth k for k-connected graphs
Engel, K
Guttmann, S
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (02) : 301 - 312
[25] ON k-DIAMETER OF k-CONNECTED GRAPHS
Xu Junming Xu Keli of Math.
AppliedMathematics:AJournalofChineseUniversities, 2001, (03) : 231 - 236
[26] On (t,k)-shredders in k-connected graphs
Nutov, Zeev
Tsugaki, Masao
ARS COMBINATORIA, 2007, 83 : 213 - 219
[27] Embeddings of k-connected graphs of pathwidth k
Gupta, A
Nishimura, N
Proskurowski, A
Ragde, P
ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 111 - 124
[28] On k-diameter of k-connected graphs
Xu J.
Xu K.
Applied Mathematics-A Journal of Chinese Universities, 2001, 16 (3) : 231 - 236
[29] k-Shredders in k-Connected Graphs
Egawa, Yoshimi
JOURNAL OF GRAPH THEORY, 2008, 59 (03) : 239 - 259
[30] Embeddings of k-connected graphs of pathwidth k
Gupta, A
Nishimura, N
Proskurowski, A
Ragde, P
DISCRETE APPLIED MATHEMATICS, 2005, 145 (02) : 242 - 265

← 1 2 3 4 5 →