  Tutte's famous 5-flow conjecture asserts that every bridgeless graph has a
nowhere-zero 5-flow. Seymour proved that every such graph has a nowhere-zero
6-flow. Here we give (two versions of) a new proof of Seymour's Theorem. Both
are roughly equal to Seymour's in terms of complexity, but they offer an
alternative perspective which we hope will be of value.
