{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:19:53Z","timestamp":1759335593716},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf01202467","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:52:41Z","timestamp":1108741961000},"page":"27-28","source":"Crossref","is-referenced-by-count":14,"title":["A short proof of Nash-Williams' theorem for the arboricity of a graph"],"prefix":"10.1007","volume":"10","author":[{"given":"Boliong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Matsumoto","sequence":"additional","affiliation":[]},{"given":"Jianfang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhongfu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jianxun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"121","volume":"28","author":"H. Enomoto","year":"1992","unstructured":"Enomoto, H.: A simple proof of Nash-Williams' formula on the arboricity of a graph. SUT Journal of Mathematics28, 121?127 (1992)","journal-title":"SUT Journal of Mathematics"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C.St.J.A. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.St.J.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc.36, 445?450 (1961)","journal-title":"J. London Math. Soc."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"C.St.J.A. Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.St.J.A.: Decomposition of finite graphs into forests. J. London Math. Soc.39, 12 (1964)","journal-title":"J. London Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202467.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202467\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202467","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:01:51Z","timestamp":1556730111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01202467"],"URL":"https:\/\/doi.org\/10.1007\/bf01202467","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}