%0 Journal Article %1 journals/gc/ChenMWZZ94 %A Chen, Boliong %A Matsumoto, Makoto %A Wang, Jianfang %A Zhang, Zhongfu %A Zhang, Jianxun %D 1994 %J Graphs and Combinatorics %K dblp %N 1 %P 27-28 %T A short proof of Nash-Williams' theorem for the arboricity of a graph. %U http://dblp.uni-trier.de/db/journals/gc/gc10.html#ChenMWZZ94 %V 10

@article{journals/gc/ChenMWZZ94, added-at = {2012-04-29T00:00:00.000+0200}, author = {Chen, Boliong and Matsumoto, Makoto and Wang, Jianfang and Zhang, Zhongfu and Zhang, Jianxun}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/25b4849b1ee66bc14f7e4b4624148a3f3/dblp}, ee = {http://dx.doi.org/10.1007/BF01202467}, interhash = {246386c0ed9664d76e89cfef2b42847a}, intrahash = {5b4849b1ee66bc14f7e4b4624148a3f3}, journal = {Graphs and Combinatorics}, keywords = {dblp}, number = 1, pages = {27-28}, timestamp = {2016-02-02T05:34:23.000+0100}, title = {A short proof of Nash-Williams' theorem for the arboricity of a graph.}, url = {http://dblp.uni-trier.de/db/journals/gc/gc10.html#ChenMWZZ94}, volume = 10, year = 1994 }