Intersecting 1-factors and nowhere-zero 5-flows
Eckhard Steffen · 2016
Let G be a bridgeless cubic graph, and µ2(G) the minimum number k such that two 1-factors of G intersect in k edges. A cyclically n-edge-connected cubic graph G has a nowhere-zero 5-flow if (1) n ≥ 6 and µ2(G) ≤ 2 or (2) if n ≥ 5µ2(G) − 3. 1