A short proof of Nash-Williams' theorem for the arboricity of a graph
From MaRDI portal
Publication:1323488
DOI10.1007/BF01202467zbMath0798.05042MaRDI QIDQ1323488
Zhong Fu Zhang, Makoto Matsumoto, Boliong Chen, Jian-Xun Zhang, Jian-fang Wang
Publication date: 10 May 1994
Published in: Graphs and Combinatorics (Search for Journal in Brave)
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Cites Work