635
правок
Изменения
→Euler Tours on Trees
==Euler Tours on Trees==
Euler Tours
In a graph G, an Euler tour is a path through the graph that visits every edge exactly once.
Mathematically formulates the “trace this figure without picking up your pencil or redrawing any lines” puzzles.
[[Файл:Simple graph.png |400px|thumb|center|Пример ]]
==Properties of Euler Tours==
