Combinatorics Trees, paths, cycles, connectivity Concept
Eulerian trail
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 gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Eulerian_path, Definition
About this page
| Tag | 05NWGBHKSZ |
|---|---|
| URI | m2://05NWGBHKSZ |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C45 |
| Specializes | Trail |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (1 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.