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