A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition
A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition
复制标题
DOI：
10.1002/jgt.10119
复制
发表时间：
2003-08
影响因子：
0.9
通讯作者：
A. Kaneko;Kiyoshi Yoshimoto
中科院分区：
文献类型：
--
作者：
A. Kaneko;Kiyoshi Yoshimoto
Chvátal and Erdös showed that a k‐connected graph with independence number at most k and order at least three is hamiltonian. In this paper, we show that a graph contains a 2‐factor with two components, i.e., the graph can be divided into two cycles if the graph is k(≥ 4)‐connected with order at least six and independence number at most k. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 269–279, 2003
