A short proof of Nash-Williams' theorem for the arboricity of a graph
- 389 Downloads
A short proof of Nash-Williams' Theorem on the arboricity of a graph is given.
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 1.Enomoto, H.: A simple proof of Nash-Williams' formula on the arboricity of a graph. SUT Journal of Mathematics28, 121–127 (1992)Google Scholar
- 2.Nash-Williams, C.St.J.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc.36, 445–450 (1961)Google Scholar
- 3.Nash-Williams, C.St.J.A.: Decomposition of finite graphs into forests. J. London Math. Soc.39, 12 (1964)Google Scholar
© Springer-Verlag 1994