Cycle double cover

In graph-theoretic mathematics, a cycle double cover is a collection of cycles in an undirected graph that together include each edge of the graph exactly twice. For instance, for any polyhedral graph, the faces of a convex polyhedron that represents the graph provide a cycle double cover of the graph: the edges of each face form a cycle and each edge belongs to exactly two faces and therefore to two of these cycles.