Year: 2013
Type: article
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.
Source: Mathematika
Authors: Christian Reiher, Lisa Sauermann
Institutions: Universität Hamburg, University of Bonn
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1976495110