2 problems

Let $G$ be a bridgeless graph, not necessarily cubic, and let $E$ denote its edge set. A cycle cover here is a list of cycles in which every edge of $G$ lies on at least one cycle.…

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