Title of article
A 4-cycle and a 2-factor with two components of a graph satisfying the Chvلtal-Erdِs condition
Author/Authors
Kaneko، نويسنده , , Atsushi and Yoshimoto، نويسنده , , Kiyoshi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
3
From page
198
To page
200
Abstract
The condition that the independence number of a graph is less than or equal to its connectivity is called the Chvátal-Erdös condition. In this paper, we show the existence of a 2-factor with two components in a k(≥ 4)-connected graph satisfying the Chvátal-Erdös condition and having at least six vertices.
Keywords
graph , Factor , Chvلtal-Erdِs condition
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2000
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452864
Link To Document