Cycle double cover
= Cycle double cover
{wiki=Cycle_double_cover}
A **cycle double cover** of a graph is a particular type of subgraph that consists of a collection of cycles in which each edge of the original graph is included in exactly two of these cycles. More formally, for a given graph \\( G \\), a cycle double cover is a set of cycles such that every edge in \\( G \\) is covered exactly twice by the cycles in the set.