---
tag: 05NWGBHKSZ
kind: concept
name: Eulerian trail
msc: [05C45]
sources:
  - url: https://en.wikipedia.org/wiki/Eulerian_path
    locator: Definition
same_as:
  wikidata: Q624580
  wikipedia: Eulerian path
---

## Summary

An Eulerian trail is a trail that uses every edge of a graph exactly once. The question of which graphs have one is the origin of graph theory. The node [[Eulerian trail|0NNYDD1AVR]] gives the precise definition.