Name
Abstract | ||
|---|---|---|
Let G be a bridgeless cubic graph. We prove that the edges of G can be covered by circuits whose total length is at most (44/27) |E(G)|, and if Tutte's 3-flow Conjecture is true, at most (92/57) |E(G)|. © 1994 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1002/jgt.3190180204 | Journal of Graph Theory |
Keywords | Field | DocType |
total length,short cycle,3-flow conjecture,wiley periodicals,cubic graph,bridgeless cubic graph | Tutte 12-cage,Discrete mathematics,Combinatorics,Graph power,Polyhedral graph,Cubic graph,Foster graph,Nowhere-zero flow,Petersen graph,Graph minor,Mathematics | Journal |
Volume | Issue | ISSN |
18 | 2 | 0364-9024 |
Citations | PageRank | References |
5 | 0.53 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Genghua Fan | 1 | 412 | 65.22 |