Graphs and Combinatorics

, Volume 10, Issue 1, pp 27–28

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

Authors

  • Boliong Chen
    • Institute of MathematicsCentral Academy
  • Makoto Matsumoto
    • RIMSKyoto University
  • Jianfang Wang
    • Institute of Applied MathematicsAcademic Sinica
  • Zhongfu Zhang
    • Lanzhou Railway Institute
  • Jianxun Zhang
    • Lanzhou Railway Institute
Original Papers

DOI: 10.1007/BF01202467

Cite this article as:
Chen, B., Matsumoto, M., Wang, J. et al. Graphs and Combinatorics (1994) 10: 27. doi:10.1007/BF01202467

Abstract

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

Copyright information

© Springer-Verlag 1994