Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching

František Kardoš, Edita Máčajová, Jean Paul Zerafa

Let $G$ be a bridgeless cubic graph. The Berge--Fulkerson Conjecture (1970s) states that $G$ admits a list of six perfect matchings such that each edge of $G$ belongs to exactly tw…