Decomposing graphs into forests
Combinatorics
2017-05-05 v1
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.
Keywords
Cite
@article{arxiv.1705.01648,
title = {Decomposing graphs into forests},
author = {Christian Reiher and Lisa Sauermann},
journal= {arXiv preprint arXiv:1705.01648},
year = {2017}
}
Comments
This version differs slightly from the version published by the Journal