The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, and was independently formulated by Szekeres and Seymour. A dual form of the problem is called the Fulkerson conjecture.

bridgeless graph | cycle double cover | Hamiltonian graph