{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T23:31:17Z","timestamp":1769124677334,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T00:00:00Z","timestamp":1692576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T00:00:00Z","timestamp":1692576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00493-023-00058-z","type":"journal-article","created":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T08:02:20Z","timestamp":1692604940000},"page":"1215-1239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Strong Nine Dragon Tree Conjecture is True for $$d \\le k + 1$$"],"prefix":"10.1007","volume":"43","author":[{"given":"Sebastian","family":"Mies","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Moore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,21]]},"reference":[{"key":"58_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-030-38919-2_5","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"M Blumenstock","year":"2020","unstructured":"Blumenstock, M., Frank Fischer, A.: A constructive arboricity approximation scheme. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020: Theory and Practice of Computer Science, pp. 51\u201363. Springer, New York (2020)"},{"key":"58_CR2","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1016\/j.jctb.2016.09.004","volume":"122","author":"M Chen","year":"2017","unstructured":"Chen, M., Kim, S.-J., Kostochka, A.V., West, D.B., Zhu, X.: Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k.2. J. Combin. Theory Ser. B 122, 741\u2013756 (2017). https:\/\/doi.org\/10.1016\/j.jctb.2016.09.004","journal-title":"J. Combin. Theory Ser. B"},{"key":"58_CR3","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jctb.2015.05.003","volume":"115","author":"G Fan","year":"2015","unstructured":"Fan, G., Li, Y., Song, N., Yang, D.: Decomposing a graph into pseudoforests with one having bounded degree. J. Combin. Theory Ser. B 115, 72\u201395 (2015). https:\/\/doi.org\/10.1016\/j.jctb.2015.05.003","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"58_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1002\/jgt22884","volume":"102","author":"H Gao","year":"2022","unstructured":"Gao, H., Yang, D.: Digraph analogues for the Nine Dragon Tree Conjecture. J. Graph Theory 102(3), 521\u2013534 (2022). https:\/\/doi.org\/10.1002\/jgt22884","journal-title":"J. Graph Theory"},{"key":"58_CR5","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.jctb.2008.07.004","volume":"99","author":"D Gon\u00e7alves","year":"2009","unstructured":"Gon\u00e7alves, D.: Covering planar graphs with forests, one having bounded maximum degree. J. Combin. Theory Ser. B 99, 314\u2013322 (2009). https:\/\/doi.org\/10.1016\/j.jctb.2008.07.004","journal-title":"J. Combin. Theory Ser. B"},{"key":"58_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.jctb.2020.07.001","volume":"145","author":"L Grout","year":"2020","unstructured":"Grout, L., Moore, B.: The pseudoforest analogue for the strong Nine Dragon Tree Conjecture is true. J. Combin. Theory Ser. B 145, 433\u2013449 (2020). https:\/\/doi.org\/10.1016\/j.jctb.2020.07.001","journal-title":"J. Combin. Theory Ser. B"},{"key":"58_CR7","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1007\/s00493-016-3390-1","volume":"1","author":"H Jiang","year":"2017","unstructured":"Jiang, H., Yang, D.: Decomposing a graph into forests: The Nine Dragon Tree Conjecture is true. Combinatorica 1, 1125\u20131137 (2017). https:\/\/doi.org\/10.1007\/s00493-016-3390-1","journal-title":"Combinatorica"},{"issue":"4","key":"58_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1002\/jgt.21711","volume":"74","author":"S-J Kim","year":"2013","unstructured":"Kim, S.-J., Kostochka, A.V., West, D.B., Wu, H., Zhu, X.: Decomposition of sparse graphs into forests and a graph with bounded degree. J. Graph Theory 74(4), 369\u2013391 (2013). https:\/\/doi.org\/10.1002\/jgt.21711","journal-title":"J. Graph Theory"},{"issue":"4","key":"58_CR9","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1002\/jgt.22416","volume":"90","author":"M Merker","year":"2019","unstructured":"Merker, M., Postle, L.: Bounded diameter arboricity. J. Graph Theory 90(4), 629\u2013641 (2019)","journal-title":"J. Graph Theory"},{"issue":"1","key":"58_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jctb.2011.04.001","volume":"102","author":"M Montassier","year":"2012","unstructured":"Montassier, M., de Mendez, P.O., Raspaud, A., Zhu, X.: Decomposing a graph into forests. J. Combin. Theory Ser. B 102(1), 38\u201352 (2012). https:\/\/doi.org\/10.1016\/j.jctb.2011.04.001","journal-title":"J. Combin. Theory Ser. B"},{"key":"58_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.jctb.2018.01.005","volume":"131","author":"D Yang","year":"2018","unstructured":"Yang, D.: Decomposing a graph into forests and a matching. J. Combin. Theory Ser. B 131, 40\u201354 (2018). https:\/\/doi.org\/10.1016\/j.jctb.2018.01.005","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00058-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00058-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00058-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T14:04:35Z","timestamp":1700834675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00058-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,21]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["58"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00058-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,21]]},"assertion":[{"value":"17 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}