Category:Eulerian Graphs

From ProofWiki
Jump to: navigation, search

This category contains results about Eulerian Graphs.


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

Also included here are results about semi-Eulerian (traversable) graphs.