Decomposing graphs into forests
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.