Name
Abstract | ||
|---|---|---|
In this paper, we show that if G is an l-connected claw-free graph with minimum degree at least three and l@?{2,3}, then for any maximum independent set S, there exists a 2-factor in which each cycle contains at least l-1 vertices in S. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.disc.2011.08.020 | Discrete Mathematics |
Keywords | Field | DocType |
maximum independent set,2-factor,claw-free graph,line graph,ryjacek closure,claw free graph | Discrete mathematics,Combinatorics,Graph power,Claw-free graph,Bipartite graph,Cycle graph,Independent set,Degree (graph theory),Mathematics,Maximal independent set,Split graph | Journal |
Volume | Issue | ISSN |
312 | 2 | 0012-365X |
Citations | PageRank | References |
3 | 0.40 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Kužel | 1 | 37 | 5.21 |
| Kenta Ozeki | 2 | 138 | 36.31 |
| Kiyoshi Yoshimoto | 3 | 133 | 22.65 |