Cyclability in -connected -free graphs

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 .