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.…

Let $G$ be a bridgeless graph, not necessarily cubic. An even subgraph is a subgraph in which every vertex of $G$ has even degree. $(5,2)$-cycle-cover conjecture. The graph $G$ con…