| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648491 | Discrete Mathematics | 2012 | 5 Pages |
Abstract
In this paper, we show that if GG is an ll-connected claw-free graph with minimum degree at least three and l∈{2,3}l∈{2,3}, then for any maximum independent set SS, there exists a 2-factor in which each cycle contains at least l−1l−1 vertices in SS.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roman Kužel, Kenta Ozeki, Kiyoshi Yoshimoto,