Skip to content
User Avatar
#945
Auto-translated
Hermit

Let's correlate the rectangles and the space around the graph's vertices. If you can get from one rectangle to another, they are connected by an edge. Since vertices B and D have odd degrees, it is impossible to construct an Eulerian cycle!
A cycle isn't necessary. It's not required to end where you started! And the diagram is incorrect...

Ничто не возникает из ничего и ничто не пропадает бесследно.
Если где-то чего-то убудет, то в другом месте добавится.

(Закон сохранения).