Skip to main content
Log in

A short proof of Nash-Williams' theorem for the arboricity of a graph

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A short proof of Nash-Williams' Theorem on the arboricity of a graph is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01202467

Keywords

Navigation