# Euler trails and circuits

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

[Catalogue presentation and source-binding data](https://ocme.evemisslab.com/data/i18n/catalogue.en.json)



## [Euler trails and circuits](https://ocme.evemisslab.com/en/atlas/atlas-eulerian-trail/)

An Euler trail uses each edge once; on connected nonzero-edge support, zero odd-degree vertices give a circuit and two give an open Euler trail.

atlas-eulerian-trail · canonical_mko

[Euler trails and circuits](https://ocme.evemisslab.com/en/mko/mko-eulerian-trail/)

## Prerequisite nodes


- [Graph walks and simple paths](https://ocme.evemisslab.com/en/atlas/atlas-graph-walk-simple-path/)
- [Finite simple undirected graphs](https://ocme.evemisslab.com/en/atlas/atlas-graph/)
- [Connected component](https://ocme.evemisslab.com/en/atlas/atlas-connected-component/)