2 problems

Archdeacon's conjecture. Every bridgeless graph has a $5$-OCDC.

Cycle double cover conjecture. Every cubic graph containing no bridges has a cycle double cover, or equivalently is the face graph of a simplicial surface. More generally, every br…