A counterexample to the bipartizing matching conjecture Original Research Article

The bipartizing matching conjecture (BMC) is a rather new approach to the nowhere zero 5-flow conjecture (NZ5FC) and the cycle double cover conjecture (CDCC). We show that the BMC is wrong in its actual version by constructing a counterexample. The construction arises from the investigation of the problem to cover the vertices of a graph by two induced Eulerian subgraphs. Finally, we state a modified version of the BMC which has the same impact on the NZ5FC and CDCC.