NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS
Christian Reiher, Lisa Sauermann · Mathematika · 2013
We give a simple graph-theoretic proof of a classical result due to Nash-Williams on covering graphs by forests. Moreover, we derive a slight generalization of this statement where some edges are preassigned to distinct forests.