Cycle covers of graphs with a nowhere-ze
✍
André Raspaud
📂
Article
📅
1991
🏛
John Wiley and Sons
🌐
English
⚖ 234 KB
👁 1 views
## Abstract It is shown that the edges of a simple graph with a nowhere‐zero 4‐flow can be covered with cycles such that the sum of the lengths of the cycles is at most |__E__(__G__)| + |__V__(__G__)| −3. This solves a conjecture proposed by G. Fan.