Decomposing graphs into forests
classification
🧮 math.CO
keywords
forestsgraphsclassicalcoveringdecomposingderivedistinctedges
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.