Abstract
The following is proved: if every bridgeless graph G has a cycle cover of length at most 7/5|E(G)|, then every bridgeless graph G has a cycle cover of length at most 7/5|E(G)| such that any edge of G is covered once or twice. © 1995 John Wiley & Sons, Inc.
Original language | English (US) |
---|---|
Pages (from-to) | 65-67 |
Number of pages | 3 |
Journal | Journal of Graph Theory |
Volume | 19 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1995 |
Externally published | Yes |
ASJC Scopus subject areas
- Geometry and Topology