2-factors and independent sets on claw-free graphs
2-factors and independent sets on claw-free graphs
复制标题
无爪图上的 2 因子和独立集
DOI：
10.1016/j.disc.2011.08.020
复制
发表时间：
2012
影响因子：
0.8
通讯作者：
K.Yoshimoto
中科院分区：
文献类型：
--
作者：
R.Kuzel;K.Ozeki;K.Yoshimoto
本文证明了：如果G是最小度至少为3的L连通无爪图，且L∈{2，3}，则对任一极大独立集S，存在一个2-因子，其中每个圈至少包含S中的L−1个点.
In this paper, we show that if G is an l-connected claw-free graph with minimum degree at least three and l∈{2,3}, then for any maximum independent set S, there exists a 2-factor in which each cycle contains at least l−1 vertices in S.