info prev up next book cdrom email home

Anarboricity

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

See also Arboricity




© 1996-9 Eric W. Weisstein
1999-05-25