Two-factors with few cycles in claw-free graphs
Two-factors with few cycles in claw-free graphs
复制标题
DOI：
10.1016/s0012-365x(00)00317-4
复制
发表时间：
2001-03
期刊：
影响因子：
--
通讯作者：
R. Gould;M. Jacobson
中科院分区：
文献类型：
--
作者：
R. Gould;M. Jacobson
Let G be a graph of order n. Define f k (G)(F k (G)) to be the minimum (maximum) number of components in a k-factor of G. For convenience, we will say that f k (G)= 0 if G does not contain a k-factor. It is known that if G is a claw-free graph with sufficiently high minimum degree and proper order parity, then G contains a k-factor. In this paper we show that f 2 (G)⩽ n/δ for n and δ sufficiently large and G claw-free. In addition, we consider F 2 (G) for claw-free graphs and look at the potential range for the number of cycles in a 2-factor.
