On 2-factors in claw-free graphs whose edges are in small cycles

Runli Tian, Liming Xiong*, Zhaohong Niu

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

2 引用 (Scopus)
Plum Print visual indicator of research metrics
  • Citations
    • Citation Indexes: 2
  • Captures
    • Readers: 4
see details

摘要

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' 的科研主题。它们共同构成独一无二的指纹。

引用此

Tian, R., Xiong, L., & Niu, Z. (2012). On 2-factors in claw-free graphs whose edges are in small cycles. Discrete Mathematics, 312(21), 3140-3145. https://doi.org/10.1016/j.disc.2012.07.005