A characterisation of graphs having three pariwise compatible Euler tours (Q1264154): Difference between revisions

Two Euler tours of a graph G are compatible if no pair of adjacent edges of G are consecutive in both tours. We obtain a good characterization for the graphs which contain three pairwise compatible Euler tours. As a corollary we deduce that the line graph of a 3-connected, 4-regular simple graph is decomposable into three edge-disjoint Hamilton circuits.