Definitionintro
Eulerian path
Also called Euler trail.
A trail that uses every edge of the graph exactly once.
A trail that uses every edge of the graph exactly once.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 93790T Edit this page History Report an error