{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:44:05Z","timestamp":1769168645639,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,10,17]],"date-time":"2016-10-17T00:00:00Z","timestamp":1476662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00493-016-3390-1","type":"journal-article","created":{"date-parts":[[2016,10,18]],"date-time":"2016-10-18T15:44:40Z","timestamp":1476805480000},"page":"1125-1137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Decomposing a Graph into Forests: The Nine Dragon Tree Conjecture is True"],"prefix":"10.1007","volume":"37","author":[{"given":"Hongbi","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Daqing","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,17]]},"reference":[{"key":"3390_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.jctb.2004.12.002","volume":"94","author":"J. Balogh","year":"2005","unstructured":"J. Balogh, M. Kochol, A. Pluh\u00e1r and X. Yu: Covering planar graphs with forests, J. Combin. Theory Ser. B\n                           94 (2005), 147\u2013158.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3390_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0166-218X(92)90002-R","volume":"40","author":"P. A. Catlin","year":"1992","unstructured":"P. A. Catlin, J. W. Grossman, A. H. Hobbs and H.-J. Lai: Fractional arboricity, strengh and principal partitions in graphs and matroids, Discrete Math. Appl.\n                           40 (1992), 285\u2013302.","journal-title":"Discrete Math. Appl."},{"key":"3390_CR3","volume-title":"Decomposition of sparse graphs into forests: the Nine Dragon Tree Conjecture for k\u22642","author":"M. Chen","year":"2014","unstructured":"M. Chen, S. Kim, A. Kostochka, D. B. West and X. Zhu: Decomposition of sparse graphs into forests: the Nine Dragon Tree Conjecture for k\u22642, preprint, 2014."},{"key":"3390_CR4","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jctb.2015.05.003","volume":"115","author":"G. Fan","year":"2015","unstructured":"G. Fan, Y. Li, N. Song and D. Yang: Decomposing a graph into pseudoforests with one having bounded degree, J. Combin. Theory Ser. B\n                           115 (2015), 72\u201395.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3390_CR5","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"S. L. Hakimi","year":"1965","unstructured":"S. L. Hakimi: On the degree of the vertices of a directed graph, J. Franklin Inst.\n                           279 (1965), 290\u2013308.","journal-title":"J. Franklin Inst."},{"key":"3390_CR6","volume-title":"\u00c9tude de diff\u00e8rents problemes de partition de graphes","author":"D. Gon\u00e7alves","year":"2006","unstructured":"D. Gon\u00e7alves: \u00c9tude de diff\u00e8rents problemes de partition de graphes, thesis, Universit\u00e8 Bordeaux 1, 2006."},{"key":"3390_CR7","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.jctb.2008.07.004","volume":"99","author":"D. Gon\u00e7alves","year":"2009","unstructured":"D. Gon\u00e7alves: Covering planar graphs with forests, one having bounded maximum degree, J. Combin. Theory Ser. B\n                           99 (2009), 314\u2013322.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3390_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1002\/jgt.21711","volume":"74","author":"S.-J. Kim","year":"2013","unstructured":"S.-J. Kim, A. V. Kostochka, D. B. West, H. Wu and X. Zhu: Decomposition of sparse graphs into forests and a graph with bounded degree, J. Graph Theory\n                           74 (2013), 369\u2013391.","journal-title":"J. Graph Theory"},{"key":"3390_CR9","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jctb.2011.04.001","volume":"102","author":"M. Montassier","year":"2012","unstructured":"M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu: Decomposing a graph into forests, J. Combin. Theory Ser. B\n                           102 (2012), 38\u201352.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3390_CR10","first-page":"12","volume":"39","author":"C. St","year":"1964","unstructured":"C. St. J. A. Nash-Williams: Decompositions of finite graphs into forests, J. London Math. Soc.\n                           39 (1964), 12.","journal-title":"J. London Math. Soc."},{"key":"3390_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0195-6698(86)80032-4","volume":"7","author":"C. Payan","year":"1986","unstructured":"C. Payan: Graphes equilibre et arboricit\u00e8 rationnelle, European J. Combin.\n                           7 (1986), 263\u2013270.","journal-title":"European J. Combin."},{"key":"3390_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/net.3230120206","volume":"12","author":"J.-C. Picard","year":"1982","unstructured":"J.-C. Picard and M. Queyranne: A network ow solution to some nonlinear 0-1 programming problems, with applications to graph theory, Networks\n                           12 (1982), 141\u2013159.","journal-title":"Networks"},{"key":"3390_CR13","volume-title":"Decompose a graph into forests and a matching","author":"D. Yang","year":"2014","unstructured":"D. Yang: Decompose a graph into forests and a matching, manuscript, 2014."},{"key":"3390_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1006\/jctb.1998.1878","volume":"75","author":"X. Zhu","year":"1999","unstructured":"X. Zhu: Game coloring number of planar graphs, J. Combin. Theory Ser. B\n                           75 (1999), 245\u2013258.","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3390-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3390-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3390-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T11:04:02Z","timestamp":1544785442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3390-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,17]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["3390"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3390-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,17]]}}}