Name
Abstract | ||
|---|---|---|
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 |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1002/jgt.v43:4 | Journal of Graph Theory |
Keywords | Field | DocType |
satisfiability | Discrete mathematics,Combinatorics,Line graph,Cubic graph,Regular graph,Null graph,Distance-regular graph,Windmill graph,Mathematics,Voltage graph,Complement graph | Journal |
Volume | Issue | Citations |
43 | 4 | 7 |
PageRank | References | Authors |
0.66 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Atsushi Kaneko | 1 | 169 | 24.21 |
| Kiyoshi Yoshimoto | 2 | 133 | 22.65 |