Definition:Edge-Disjoint Trails

Definition

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 if and only if they have no edges in common.