Name
Abstract | ||
|---|---|---|
For a non-hamiltonian claw-free graph G with order n and minimum degree δ we show the following. If δ=4, then G has a 2-factor with at most (5n−14)/18 components, unless G belongs to a finite class of exceptional graphs. If δ⩾5, then G has a 2-factor with at most (n−3)/(δ−1) components. These bounds are sharp in the sense that we can replace nor 5/18 by a smaller quotient nor δ−1 by δ. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.endm.2007.07.050 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
claw-free graph,2-factor,minimum degree,edge degree | Discrete mathematics,Graph,Claw,Combinatorics,Claw-free graph,Quotient,Mathematics | Journal |
Volume | ISSN | Citations |
29 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hajo Broersma | 1 | 741 | 87.39 |
| Daniel Paulusma | 2 | 102 | 14.89 |
| Kiyoshi Yoshimoto | 3 | 133 | 22.65 |