Let be the complete symmetric digraph with a loop at each vertex. The authors say that two eulerian circuits of are compatible if no pair of arcs of the digraph are consecutive in both eulerian circuits. They prove that there exist pairwise compatible eulerian circuits in , where denotes the Euler function, and the authors give an effective construction of these circuits.
