From ProofWiki
Jump to navigation Jump to search


A trail is a walk in which all edges are distinct.

A trail between two vertices $u$ and $v$ is called a $u$-$v$ trail.


The set of vertices and edges which go to make up a trail in a graph $G$ form a subgraph of $G$.

This subgraph itself is also referred to as a trail in $G$.

Also known as

A trail can also be seen referred to as an Eulerian walk, for Leonhard Paul Euler.

Also see

  • Results about trails can be found here.