{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:55Z","timestamp":1725586855844},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_25","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T09:58:49Z","timestamp":1308391129000},"page":"315-323","source":"Crossref","is-referenced-by-count":2,"title":["Degree Bounded Forest Covering"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lap Chi","family":"Lau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1016\/j.ejc.2007.06.020","volume":"29","author":"O.V. Borodin","year":"2008","unstructured":"Borodin, O.V., Kostochka, A.V., Sheikh, N.N., Yu, G.: Decomposing a planar graph with girth 9 into a forest and a matching. European J. Combin.\u00a029, 1235\u20131241 (2008)","journal-title":"European J. Combin."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.jctb.2008.07.004","volume":"99","author":"D. Goncalves","year":"2009","unstructured":"Goncalves, D.: Covering planar graphs with forests, one having bounded maximum degree. J. Combin. Theory Ser. B\u00a099, 314\u2013322 (2009)","journal-title":"J. Combin. Theory Ser. B"},{"key":"25_CR3","unstructured":"Kaiser, T., Montassier, M., Raspaud, A.: Covering a graph by forests and a matching. arXiv:1007.0316v1 (2010)"},{"key":"25_CR4","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 (2010) (submitted)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-68891-4_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"T. Kir\u00e1ly","year":"2008","unstructured":"Kir\u00e1ly, T., Lau, L.C., Singh, M.: Degree bounded matroids and submodular flows. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 259\u2013272. Springer, Heidelberg (2008)"},{"key":"25_CR6","unstructured":"Montassier, M., Ossona de Mendez, P., Raspaud, A., Zhu, X.: Decomposing a graph into forests (2010) (manuscript)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"1520","DOI":"10.1016\/j.disc.2010.01.008","volume":"310","author":"M. Montassier","year":"2010","unstructured":"Montassier, M., Pecher, A., Raspaud, A., West, D.B., Zhu, X.: Decomposition of sparse graphs, with application to game coloring number. Discrete Mathematics\u00a0310, 1520\u20131523 (2010)","journal-title":"Discrete Mathematics"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. J. London Math. Soc.\u00a039(12) (1964)","DOI":"10.1112\/jlms\/s1-39.1.12"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T22:31:22Z","timestamp":1553812282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}