(5,2)-cycle-cover conjecture for bridgeless graphs

Let $G$ be a bridgeless graph, not necessarily cubic. An even subgraph is a subgraph in which every vertex has even degree.

$(5,2)$-cycle-cover conjecture. The graph $G$ contains five even subgraphs such that every edge of $G$ belongs to exactly two of them.

The conjecture is presented as a classical consequence of the Petersen coloring conjecture. The supplied source gives no evidence that it has been resolved.