BranchesHistoryHelpLogin
Welcome guest
You're not logged in.
273 users online, thereof 0 logged in

Theorem: Characterization of Eulerian Graphs

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]

1.Proof: (related to "Characterization of Eulerian Graphs")

Edit or AddNotationAxiomatic Method

This work was contributed under CC BY-SA 3.0 by:

This work is a derivative of:

(none)

Bibliography (further reading)

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