Abstract
A short proof of Nash-Williams' Theorem on the arboricity of a graph is given.
Similar content being viewed by others
References
Enomoto, H.: A simple proof of Nash-Williams' formula on the arboricity of a graph. SUT Journal of Mathematics28, 121–127 (1992)
Nash-Williams, C.St.J.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc.36, 445–450 (1961)
Nash-Williams, C.St.J.A.: Decomposition of finite graphs into forests. J. London Math. Soc.39, 12 (1964)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, B., Matsumoto, M., Wang, J. et al. A short proof of Nash-Williams' theorem for the arboricity of a graph. Graphs and Combinatorics 10, 27–28 (1994). https://doi.org/10.1007/BF01202467
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01202467