Cycle double covers of graphs with Hamilton paths (Q1089005)

A k-cycle double cover of a graph G is a collection Z of at most k eulerian subgraphs of G such that every edge of G is an edge of exactly two subgraphs in Z. Presented is a short proof of the following theorem due to \textit{M. Tarsi} [``Semi-duality and the cycle double cover conjecture,'' J. Comb. Theory, Ser. B 41, 332-340 (1986; Zbl 0607.05019)]: Every bridgeless graph containing a Hamilton path has a 6- cycle double cover.