Definition:Edge-Disjoint Trails

Let $$G = \left({V, E}\right)$$ be a loop-multigraph.

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.