Definition:Semi-Eulerian Graph

From ProofWiki
Jump to navigation Jump to search


A graph is called semi-Eulerian if and only if it contains an Eulerian trail.

Note that the definition of graph here includes:

Note that an Eulerian graph is also semi-Eulerian, as an Eulerian circuit is still a path, and therefore an Eulerian trail.

Also known as

A semi-Eulerian graph is also called a traversable graph.

Some sources have transversable graph but it is suspected that this is a mistake.

Also see

  • Results about Eulerian graphs can be found here.

Source of Name

This entry was named for Leonhard Paul Euler.