Cycle covers of graphs with a nowhere‐zero 4‐flow
André Raspaud · Journal of Graph Theory · 1991
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.