{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:47:06Z","timestamp":1767138426507,"version":"build-2238731810"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662535356","type":"print"},{"value":"9783662535363","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53536-3_7","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T12:39:25Z","timestamp":1474979965000},"page":"74-84","source":"Crossref","is-referenced-by-count":4,"title":["Packing and Covering Immersion Models of Planar Subcubic Graphs"],"prefix":"10.1007","author":[{"given":"Archontia C.","family":"Giannopoulou","sequence":"first","affiliation":[]},{"given":"O-joung","family":"Kwon","sequence":"additional","affiliation":[]},{"given":"Jean-Florent","family":"Raymond","sequence":"additional","affiliation":[]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"key":"7_CR1","unstructured":"Belmonte, R., Giannopoulou, A., Lokshtanov, D., Thilikos, D.M.: The Structure of $$W_4$$ -Immersion-Free Graphs. CoRR, abs\/1602.02002 (2016)"},{"issue":"2","key":"7_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s00493-007-0047-0","volume":"27","author":"E Birmel\u00e9","year":"2007","unstructured":"Birmel\u00e9, E., Bondy, J.A., Reed, B.A.: The Erd\u0151s-P\u00f3sa property for long circuits. Combinatorica 27(2), 135\u2013145 (2007)","journal-title":"Combinatorica"},{"key":"7_CR3","unstructured":"Chatzidimitriou, D., Raymond, J.-F., Sau, I., Thilikos, D.M.: Minors in graphs of large $$\\theta _r$$ -girth. CoRR, abs\/1510.03041 (2015)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Chuzhoy, J.: Large-treewidth graph decompositions and applications. In: 45st Annual ACM Symposium on Theory of Computing (STOC), pp. 291\u2013300 (2013)","DOI":"10.1145\/2488608.2488645"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Chuzhoy, J.: Polynomial bounds for the grid-minor theorem. CoRR, abs\/1305.6577 (2013)","DOI":"10.1145\/2591796.2591813"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J.: Excluded grid theorem: improved and simplified. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 645\u2013654 (2015)","DOI":"10.1145\/2746539.2746551"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J.: Improved bounds for the excluded grid theorem. CoRR, abs\/1602.02629 (2015)","DOI":"10.1145\/2746539.2746551"},{"key":"7_CR8","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"issue":"2","key":"7_CR9","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.jctb.2011.08.001","volume":"102","author":"R Diestel","year":"2012","unstructured":"Diestel, R., Kawarabayashi, K., Wollan, P.: The Erd\u0151s-P\u00f3sa property for clique minors in highly connected graphs. J. Comb. Theor. Ser. B 102(2), 454\u2013469 (2012)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1\u20133","key":"7_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0012-365X(94)00337-I","volume":"149","author":"G Ding","year":"1996","unstructured":"Ding, G., Oporowski, B.: On tree-partitions of graphs. Discrete Math. 149(1\u20133), 45\u201358 (1996)","journal-title":"Discrete Math."},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P., P\u00f3sa, L.: On independent circuits contained in a graph. Can. J. Math. 17, 347\u2013352 (1965)","journal-title":"Can. J. Math."},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/978-3-662-48054-0_29","volume-title":"Mathematical Foundations of Computer Science 2015","author":"R Ganian","year":"2015","unstructured":"Ganian, R., Kim, E.J., Szeider, S.: Algorithmic applications of tree-cut width. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 348\u2013360. Springer, Heidelberg (2015)"},{"issue":"2","key":"7_CR13","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.jctb.2008.08.004","volume":"99","author":"J Geelen","year":"2009","unstructured":"Geelen, J., Kabell, K.: The Erd\u0151s-P\u00f3sa property for matroid circuits. J. Comb. Theor. Ser. B 99(2), 407\u2013419 (2009)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1\u20133","key":"7_CR14","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0012-365X(91)90436-6","volume":"97","author":"R Halin","year":"1991","unstructured":"Halin, R.: Tree-partitions of infinite graphs. Discrete Math. 97(1\u20133), 203\u2013217 (1991)","journal-title":"Discrete Math."},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.tcs.2015.02.004","volume":"576","author":"N Kakimura","year":"2015","unstructured":"Kakimura, N., Kawarabayashi, K.: Fixed-parameter tractability for subset feedback set problems with parity constraints. Theor. Comput. Sci. 576, 61\u201376 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"7_CR16","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1016\/j.disc.2006.07.008","volume":"307","author":"K-I Kawarabayashi","year":"2007","unstructured":"Kawarabayashi, K.-I., Nakamoto, A.: The Erd\u00f6s-p\u00f3sa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces. Discrete Math. 307(6), 764\u2013768 (2007)","journal-title":"Discrete Math."},{"issue":"1","key":"7_CR17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0095-8956(03)00078-9","volume":"90","author":"D Kr\u00e1l\u2019","year":"2004","unstructured":"Kr\u00e1l\u2019, D., Voss, H.-J.: Edge-disjoint odd cycles in planar graphs. J. Comb. Theor. Ser. B 90(1), 107\u2013120 (2004)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"7_CR18","unstructured":"Liu, C.-H.: Packing and covering immersions in 4-edge-connected graphs. CoRR, abs\/1505.00867 (2015)"},{"issue":"2","key":"7_CR19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s004930100024","volume":"21","author":"D Rautenbach","year":"2001","unstructured":"Rautenbach, D., Reed, B.A.: The Erdos-P\u00f3sa property for odd cycles in highly connected graphs. Combinatorica 21(2), 267\u2013278 (2001)","journal-title":"Combinatorica"},{"issue":"8","key":"7_CR20","doi-asserted-by":"crossref","first-page":"2027","DOI":"10.1016\/j.disc.2016.03.004","volume":"339","author":"J-F Raymond","year":"2016","unstructured":"Raymond, J.-F., Sau, I., Thilikos, D.M.: An edge variant of the Erd\u0151s-P\u00f3sa property. Discrete Math. 339(8), 2027\u20132035 (2016)","journal-title":"Discrete Math."},{"issue":"4","key":"7_CR21","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/BF01271272","volume":"16","author":"BA Reed","year":"1996","unstructured":"Reed, B.A., Robertson, N., Seymour, P.D., Thomas, R.: Packing directed circuits. Combinatorica 16(4), 535\u2013554 (1996)","journal-title":"Combinatorica"},{"issue":"2","key":"7_CR22","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. excluding a planar graph. J. Comb. Theor. Ser. B 41(2), 92\u2013114 (1986)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/BFb0028825","volume-title":"Proceedings of Fundamentals of Computation Theory","author":"D Seese","year":"1985","unstructured":"Seese, D.: Tree-partite graphs and the complexity of algorithms. In: Budach, L. (ed.) Proceedings of Fundamentals of Computation Theory. LNCS, vol. 199, pp. 412\u2013421. Springer, Heidelberg (1985)"},{"key":"7_CR24","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.jctb.2014.07.003","volume":"110","author":"P Wollan","year":"2015","unstructured":"Wollan, P.: The structure of graphs not admitting a fixed immersion. J. Comb. Theor. Ser. B 110, 47\u201366 (2015)","journal-title":"J. Comb. Theor. Ser. B"}],"updated-by":[{"DOI":"10.1007\/978-3-662-53536-3_26","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2017,6,8]],"date-time":"2017-06-08T00:00:00Z","timestamp":1496880000000}}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53536-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T22:01:38Z","timestamp":1568412098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}