Noun
anarboricity (uncountable) (graph theory) The maximum number of edge-disjoint cyclic subgraphs of a graph G whose union is G. Antonym: arboricity