Name
Title | ||
|---|---|---|
A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition |
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. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S1571-0653(05)80162-3 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
graph,Chvátal-Erdös condition,factor | Discrete mathematics,Strength of a graph,Combinatorics,Graph toughness,Graph power,Cycle graph,Regular graph,Null graph,Distance-regular graph,Mathematics,Complement graph | Journal |
Volume | ISSN | Citations |
5 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Atsushi Kaneko | 1 | 169 | 24.21 |
| Kiyoshi Yoshimoto | 2 | 133 | 22.65 |