Anarboricity

Given a Graph $G$, the anarboricity is the maximum number of line-disjoint nonacyclic Subgraphs whose Union is $G$.

See also Arboricity