# Category:Eulerian Graphs

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.

## Pages in category "Eulerian Graphs"

The following 8 pages are in this category, out of 8 total.

### C

- Characteristics of Eulerian Graph
- Characteristics of Eulerian Graph/Necessary Condition
- Characteristics of Eulerian Graph/Sufficient Condition
- Characteristics of Eulerian Graph/Sufficient Condition/Proof 1
- Characteristics of Eulerian Graph/Sufficient Condition/Proof 2
- Characteristics of Traversable Graph