Definition:Eulerian Graph

From ProofWiki
Jump to navigation Jump to search


A loop-multigraph or loop-multidigraph is called Eulerian if and only if it contains an Eulerian circuit.

An Eulerian graph is also, by definition, traversable.

Also known as

An Eulerian graph is also called a unicursal graph.

Also see

  • Results about Eulerian graphs can be found here.

Source of Name

This entry was named for Leonhard Paul Euler.

Linguistic Note

After the pronunciation of Euler as Oiler, the word Eulerian is pronounced something like oy-leer-ee-an.

The term unicursal, derives from the prefix uni-, an adjectival form of one and cursal, which derives from the Latin cursor, meaning runner.

Hence a unicursal graph can be understood as a graph which can be drawn in a single run.