A short proof of Nash-Williams' theorem for the arboricity of a graph
From MaRDI portal
Publication:1323488
DOI10.1007/BF01202467zbMath0798.05042MaRDI QIDQ1323488
Makoto Matsumoto, Boliong Chen, Zhong Fu Zhang, Jian-Xun Zhang, Jian-fang Wang
Publication date: 10 May 1994
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Extensions of matroid covering and packing, Fast approximation for computing the fractional arboricity and extraction of communities of a graph, NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS, Simple planar graph partition into three forests, Self-stabilizing Cuts in Synchronous Networks, A Short Proof of the Random Ramsey Theorem, An enhancement of Nash-Williams' theorem on edge arboricity of graphs, A self-stabilizing algorithm for cut problems in synchronous networks
Cites Work
