Abstract
We give a simple graph-theoretic proof of a classical result due to C. St. J. A. Nash-Williams on covering graphs by forests. Moreover we derive a slight generalisation of this statement where some edges are preassigned to distinct forests.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have