Arboricity

Given a Graph $G$, the arboricity is the Minimum number of line-disjoint acyclic Subgraphs whose Union is $G$.

See also Anarboricity