INTERSECTING 1-FACTORS AND NOWHERE-ZERO 5-FLOWS

摘要

Let G be a bridgeless cubic graph, and mu(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 mu(2)(G) <= 2 or (2) if n >= 5 mu(2)(G) - 3.