| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9512189 | Discrete Mathematics | 2005 | 7 Pages |
Abstract
Let G be a graph with odd edge-connectivity r. It is proved in this paper that if r>3, then G has a 3-cycle (1,2)-cover of total length at most ((r+1)|E(G)|)/r.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jinlong Shu, Cun-Quan Zhang,