Five cycle double covers of some cubic graphs (Q1892855): Difference between revisions

The main result of this paper can be roughly described as follows. Any bridgeless cubic graph \(G\) having a two-factor with at most two odd components has a 5-cycle double cover, i.e., there exists a collection \({\mathcal L}\) of five Eulerian subgraphs of \(G\) such that every edge of \(G\) is an edge of exactly two subgraphs in \({\mathcal L}\). This generalizes and improves several known results. For instance, we can show that any graph with a Hamilton path has a 5-cycle double cover.