Title of article
Cyclability in -connected -free graphs
Author/Authors
Flandrin، نويسنده , , Evelyne and Gy?ri، نويسنده , , Ervin and Li، نويسنده , , Hao and Shu، نويسنده , , Jinlong، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
7
From page
2735
To page
2741
Abstract
It is proved that if G is a k -connected K 1 , 4 -free graph and S is a subset of vertices such that k ≥ 3 and | S | ≤ 2 k then G has a cycle containing S . A similar result is obtained when restricting the k -connectivity assumption to the subset S .
Keywords
Subset of vertices , Cyclability , k -connected graph , K 1 , 4 -free graph
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1599427
Link To Document