{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:04Z","timestamp":1725490264994},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_32","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T01:03:12Z","timestamp":1343264592000},"page":"360-370","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing Graphs of Small Carving-Width"],"prefix":"10.1007","author":[{"given":"R\u00e9my","family":"Belmonte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Kami\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/3-540-45071-8_40","volume-title":"Computing and Combinatorics","author":"F.N. Abu-Khzam","year":"2003","unstructured":"Abu-Khzam, F.N., Langston, M.A.: Graph Coloring and the Immersion Order. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 394\u2013403. Springer, Heidelberg (2003)"},{"issue":"2","key":"32_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0607033","volume":"7","author":"S. Arnborg","year":"1986","unstructured":"Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM J. Algebraic Discrete Methods\u00a07(2), 305\u2013314 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1-2","key":"32_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"32_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/jagm.1999.1011","volume":"32","author":"H.L. Bodlaender","year":"1999","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Graphs with branchwidth at most three. Journal of Algorithms\u00a032(2), 167\u2013194 (1999)","journal-title":"Journal of Algorithms"},{"key":"32_CR5","unstructured":"DeVos, M., Dvo\u0159\u00e1k, Z., Fox, J., McDonald, J., Mohar, B., Scheide, D.: Minimum degree condition forcing complete graph immersion. CoRR, arXiv:1101.2630 (January 2011)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, Electronic edn. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"issue":"5","key":"32_CR7","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.ejc.2011.09.014","volume":"33","author":"Z. Dvo\u0159\u00e1k","year":"2012","unstructured":"Dvo\u0159\u00e1k, Z., Giannopoulou, A.C., Thilikos, D.M.: Forbidden graphs for tree-depth. European Journal of Combinatorics\u00a033(5), 969\u2013979 (2012)","journal-title":"European Journal of Combinatorics"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kawarabayashi, K., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: Proceedings of STOC 2011, pp. 479\u2013488. ACM (2011)","DOI":"10.1145\/1993636.1993700"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Kobayashi, Y.: List-coloring graphs without subdivisions and without immersions. In: Proceedings of SODA 2012, pp. 1425\u20131435. SIAM (2012)","DOI":"10.1137\/1.9781611973099.112"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0020-0190(94)90044-2","volume":"50","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Designing multicommodity flow trees. Information Processing Letters\u00a050, 49\u201355 (1994)","journal-title":"Information Processing Letters"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.endm.2011.09.088","volume":"38","author":"A. Koutsonas","year":"2011","unstructured":"Koutsonas, A., Thilikos, D.M., Yamazaki, K.: Outerplanar obstructions for matroid pathwidth. Electronic Notes in Discrete Mathematics\u00a038, 541\u2013546 (2011)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1090\/S0273-0979-1993-00335-5","volume":"28","author":"N. Robertson","year":"1993","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Linkless embeddings of graphs in 3-space. Bull. Amer. Math. Soc.\u00a028, 84\u201389 (1993)","journal-title":"Bull. Amer. Math. Soc."},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jctb.2009.07.003","volume":"100","author":"N. Robertson","year":"2010","unstructured":"Robertson, N., Seymour, P.D.: Graph minors XXIII. Nash-Williams\u2019 immersion conjecture. Journal of Combinatorial Theory, Series B\u00a0100, 181\u2013205 (2010)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1016\/j.ejc.2011.09.018","volume":"33","author":"J. Ru\u00e9","year":"2012","unstructured":"Ru\u00e9, J., Stavropoulos, K.S., Thilikos, D.M.: Outerplanar obstructions for a feedback vertex set. European Journal of Combinatorics\u00a033, 948\u2013968 (2012)","journal-title":"European Journal of Combinatorics"},{"issue":"2","key":"32_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P.D. Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica\u00a014(2), 217\u2013241 (1994)","journal-title":"Combinatorica"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0012-365X(94)90092-2","volume":"127","author":"A. Takahashi","year":"1994","unstructured":"Takahashi, A., Ueno, S., Kajitani, Y.: Minimal acyclic forbidden minors for the family of graphs with bounded path-width. Discrete Mathematics\u00a0127, 293\u2013304 (1994)","journal-title":"Discrete Mathematics"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(00)00175-X","volume":"105","author":"D.M. Thilikos","year":"2000","unstructured":"Thilikos, D.M.: Algorithms and obstructions for linear-width and related search parameters. Discrete Applied Mathematics\u00a0105, 239\u2013271 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-40996-3_17","volume-title":"Algorithms and Computation","author":"D.M. Thilikos","year":"2000","unstructured":"Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 192\u2013203. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T14:15:57Z","timestamp":1561990557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}