On the number of components in 2-factors of claw-free graphs
On the number of components in 2-factors of claw-free graphs
复制标题
DOI：
10.1016/j.disc.2006.11.022
复制
发表时间：
2007-10
期刊：
影响因子：
--
通讯作者：
Kiyoshi Yoshimoto
中科院分区：
文献类型：
--
作者：
Kiyoshi Yoshimoto
本文证明了如果一个最小度δ⩾为4的无爪图G没有两个顶点的最大团，则G有一个至多有(|G|-1)/4个分支的2-因子。这一上限是最有可能的。此外，我们还给出了一族最小度δ⩾为4的无爪图，其中每个2-因子包含n/δ个以上的分支。
In this paper, we prove that if a claw-free graph G with minimum degree δ⩾4 has no maximal clique of two vertices, then G has a 2-factor with at most (|G|-1)/4 components. This upper bound is best possible. Additionally, we give a family of claw-free graphs with minimum degree δ⩾4 in which every 2-factor contains more than n/δ components.