摘要
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.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 3140-3145 |
| 页数 | 6 |
| 期刊 | Discrete Mathematics |
| 卷 | 312 |
| 期 | 21 |
| DOI | |
| 出版状态 | 已出版 - 6 11月 2012 |
指纹
探究 'On 2-factors in claw-free graphs whose edges are in small cycles' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver