Category:Eulerian Circuits

From ProofWiki
Jump to navigation Jump to search

This category contains results about Eulerian Circuits.
Definitions specific to this category can be found in Definitions/Eulerian Circuits.

An Eulerian circuit is a circuit that passes through every vertex of a graph and uses every edge exactly once.

Pages in category "Eulerian Circuits"

This category contains only the following page.