Nacionalni portal odprte znanosti

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 admits two such avoiding circuits starting from any vertex is said to be doubly Eulerian. The motivation for this defin ...