New posts in Eulerian Path

3-regular graph and two-way Euler circuit

An ant walks on a cube over the diagonals of little cubes. Can it visit all little faces exactly once?

Does Eulerian cycle in digraph really need strongly connected component?

Is it possible to draw this picture without lifting the pen?

Proof : cannot draw this figure without lifting the pen