\begin{definition}[Definition:Edge-Disjoint Trails]
Let $G = \struct {V, E}$ be an undirected graph.
Let $T_1$ and $T_2$ be trails in $G$.
Then $T_1$ and $T_2$ are '''edge-disjoint''' {{iff}} they have no edges in common.
Category:Definitions/Graph Theory
\end{definition}