Mutually avoiding Eulerian circuits

Grahame Erskine, Terry Griggs, Robert Lewis +1

Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which…