Hermit
Auto-translated
Let's correlate the rectangles and the space around the graph's vertices. If it's possible to get from one rectangle to another, then they are connected by an edge. Since vertices B and D have odd degrees, it's impossible to construct an Eulerian cycle!
Всё не так плохо как Вы думаете. Всё намного хуже!