| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648008 | Discrete Mathematics | 2012 | 6 Pages |
Abstract
It is showed that every simple claw-free graph of minimum degree at least 3 in which every edge lies in a cycle of length at most 5 has a 2-factor.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Runli Tian, Liming Xiong, Zhaohong Niu,