Cycle double cover conjecture

Cycle Double Cover Conjecture

For every graph with no bridge, there is a list of cycles so that every edge is contained in exactly two.

Concepts

The following concepts are used at this website. Here you can find an explanation of these concepts.