|
Related articles:
Hamiltonian path
Leonhard Euler
Key terms: algorithm called eulerian connected construct cycle definition degree each edge exactly once edge eulerian eulerian circuits eulerian graphs eulerian if it is connected eulerian path even degree every vertex fleury graph graph is eulerian if graph theory hamiltonian path path problem same vertex start trail two vertices undirected graph vertex vertices vertices of odd degree visits walk we Search external links cited by footnotes on Wikipedia page Eulerian path: |
|