A short proof of Nash-Williams' theorem for the arboricity of a graph
- Cite this article as:
- Chen, B., Matsumoto, M., Wang, J. et al. Graphs and Combinatorics (1994) 10: 27. doi:10.1007/BF01202467
A short proof of Nash-Williams' Theorem on the arboricity of a graph is given.