Hermit
Auto-translated
A cycle in a graph is called Eulerian if it contains all the edges of the graph. A connected graph that has an Eulerian cycle is called an Eulerian graph. Such a graph can be drawn without lifting the pencil from the paper and without repeating any lines.
Всё не так плохо как Вы думаете. Всё намного хуже!