Name
Abstract | ||
|---|---|---|
Let G be a graph with odd edge-connectivity r. It is proved in this paper that if r3, then G has a 3-cycle (1,2)-cover of total length at most ((r+1)|E(G)|)/r. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.disc.2005.06.013 | Discrete Mathematics |
Keywords | Field | DocType |
cycle cover,odd-edge connectivity,r-graph,shortest cycle cover | Graph,Discrete mathematics,Cycle cover,Combinatorics,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
301 | 2-3 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.38 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinlong Shu | 1 | 99 | 24.28 |
| Cun-Quan Zhang | 2 | 496 | 69.81 |