|
Related articles:
Degree (graph theory)
Hamiltonian path
Leonhard Euler
Key terms: graph eulerian degree vertex cycle edges vertices graph theory trail algorithm connected undirected path eulerian cycle connected component undirected graph odd degree if and only if exactly exists orientation bruijn two vertices unused every vertex exactly once proof connected graph each edge each vertex strongly connected log tutte theorem decomposed visits all vertices complexity Search external links cited by footnotes on Wikipedia page Eulerian path: |
|