A finite graph with at least three vertices is Eulerian exactly when it is connected and every vertex has even degree. A maximal trail closes by parity; closed trails based at vertices with unused incident edges can then be spliced together.

Ancestors (6)

  1. Eulerian graph
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (3)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version