A simple graph \(G(V,E)\) is Eulerian, if and only if it is connected and every vertex has an even degree.

This theorem is due to the Swiss mathematician Leonhard Euler.

| | | | | created: 2017-01-18 11:15:46 | modified: 2019-03-31 00:37:44 | by: *bookofproofs* | references: [566]

(none)

[566] **Aldous Joan M., Wilson Robin J.**: “Graphs and Applications – An Introductory Approach”, Springer, 2000