Category:Eulerian Graphs

From ProofWiki
Jump to navigation Jump to search

This category contains results about Eulerian Graphs.
Definitions specific to this category can be found in Definitions/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.

Subcategories

This category has the following 3 subcategories, out of 3 total.