A formula proved by Crispin Nash-Williams characterizes the arboricity exactly: it is the maximum, over all subgraphs H of the given graph G, of the quantity E(H)|}{|V(H)|-1}\right\rceil.
Disk partitioning |