Article contents
NASH-WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS
Published online by Cambridge University Press: 06 August 2013
Abstract
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.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © University College London 2013
References
- 1
- Cited by