Intersecting 1-factors and nowhere-zero 5-flows

Abstract

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\ge 6$ and ${\mu }_2(G)\le 2$ or (2) if $n\ge 5{\mu }_2(G)-3$

8 pages, 1 figure

Cited by in corpus (1)

• Petersen cores and the oddness of cubic graphs