| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648890 | Discrete Mathematics | 2010 | 7 Pages |
Abstract
It is proved that if GG is a kk-connected K1,4K1,4-free graph and SS is a subset of vertices such that k≥3k≥3 and |S|≤2k|S|≤2k then GG has a cycle containing SS. A similar result is obtained when restricting the kk-connectivity assumption to the subset SS.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Evelyne Flandrin, Ervin Győri, Hao Li, Jinlong Shu,