{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:35:04Z","timestamp":1777520104994,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T00:00:00Z","timestamp":1407888000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s00454-014-9614-5","type":"journal-article","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T18:06:22Z","timestamp":1407866782000},"page":"399-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Coloring Intersection Graphs of Arc-Connected Sets in the Plane"],"prefix":"10.1007","volume":"52","author":[{"given":"Micha\u0142","family":"Laso\u0144","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Micek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arkadiusz","family":"Pawlik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bartosz","family":"Walczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,13]]},"reference":[{"key":"9614_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.7146\/math.scand.a-10607","volume":"8","author":"E Asplund","year":"1960","unstructured":"Asplund, E., Gr\u00fcnbaum, B.: On a colouring problem. Math. Scand. 8, 181\u2013188 (1960)","journal-title":"Math. Scand."},{"key":"9614_CR2","unstructured":"Burling, J.P.: On coloring problems of families of prototypes. PhD thesis, University of Colorado, Boulder (1965)"},{"issue":"3","key":"9614_CR3","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1017\/S0963548309990459","volume":"19","author":"J Fox","year":"2010","unstructured":"Fox, J., Pach, J.: A separator theorem for string graphs and its applications. Comb. Probab. Comput. 19(3), 371\u2013390 (2010)","journal-title":"Comb. Probab. Comput."},{"issue":"5","key":"9614_CR4","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1016\/j.ejc.2011.09.021","volume":"33","author":"J Fox","year":"2012","unstructured":"Fox, J., Pach, J.: Coloring $$K_k$$ K k -free intersection graphs of geometric objects in the plane. Eur. J. Comb. 33(5), 853\u2013866 (2012)","journal-title":"Eur. J. Comb."},{"issue":"2","key":"9614_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(85)90044-5","volume":"55","author":"A Gy\u00e1rf\u00e1s","year":"1985","unstructured":"Gy\u00e1rf\u00e1s, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discrete Math. 55(2), 161\u2013166 (1985)","journal-title":"Discrete Math."},{"issue":"3","key":"9614_CR6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0012-365X(86)90224-4","volume":"62","author":"A Gy\u00e1rf\u00e1s","year":"1986","unstructured":"Gy\u00e1rf\u00e1s, A.: Corrigendum: on the chromatic number of multiple interval graphs and overlap graphs. Discrete Math. 62(3), 333 (1986)","journal-title":"Discrete Math."},{"issue":"1","key":"9614_CR7","doi-asserted-by":"crossref","first-page":"R52","DOI":"10.37236\/1805","volume":"11","author":"S-J Kim","year":"2004","unstructured":"Kim, S.-J., Kostochka, A., Nakprasit, K.: On the chromatic number of intersection graphs of convex sets in the plane. Electron. J. Comb. 11(1), R52 (2004)","journal-title":"Electron. J. Comb."},{"issue":"1\u20133","key":"9614_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0012-365X(96)00344-5","volume":"163","author":"A Kostochka","year":"1997","unstructured":"Kostochka, A., Kratochv\u00edl, J.: Covering and coloring polygon-circle graphs. Discrete Math. 163(1\u20133), 299\u2013305 (1997)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"9614_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(95)00316-O","volume":"154","author":"S McGuinness","year":"1996","unstructured":"McGuinness, S.: On bounding the chromatic number of L-graphs. Discrete Math. 154(1\u20133), 179\u2013187 (1996)","journal-title":"Discrete Math."},{"issue":"4","key":"9614_CR10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/PL00007228","volume":"16","author":"S McGuinness","year":"2000","unstructured":"McGuinness, S.: Colouring arcwise connected sets in the plane I. Graphs Comb. 16(4), 429\u2013439 (2000)","journal-title":"Graphs Comb."},{"key":"9614_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphes. Colloq. Math. 3, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"issue":"3","key":"9614_CR12","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1007\/s00454-013-9534-9","volume":"50","author":"A Pawlik","year":"2013","unstructured":"Pawlik, A., Kozik, J., Krawczyk, T., Laso\u0144, M., Micek, P., Trotter, W.T., Walczak, B.: Triangle-free geometric intersection graphs with large chromatic number. Discrete Comput. Geom. 50(3), 714\u2013726 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"9614_CR13","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/j.jctb.2013.11.001","volume":"105","author":"A Pawlik","year":"2014","unstructured":"Pawlik, A., Kozik, J., Krawczyk, T., Laso\u0144, M., Micek, P., Trotter, W.T., Walczak, B.: Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory Ser. B 105, 6\u201310 (2014)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9614_CR14","doi-asserted-by":"crossref","unstructured":"Rok, A., Walczak, B.: Outerstring graphs are $$\\chi $$ \u03c7 -bounded. In: Cheng, S.W., Devillers, O. (eds.) 30th Annual Symposium on Computational Geometry (SoCG 2014), pp 136\u2013143. ACM, New York (2014)","DOI":"10.1145\/2582112.2582115"},{"key":"9614_CR15","doi-asserted-by":"crossref","unstructured":"Suk, A.: Coloring intersection graphs of $$x$$ x -monotone curves in the plane. Combinatorica (in press). doi: 10.1007\/s00493-014-2942-5","DOI":"10.1007\/s00493-014-2942-5"},{"key":"9614_CR16","unstructured":"Zykov, A.A.: On some properties of linear complexes. Mat. Sb. (N.S.) 24(66)(2), 163\u2013188 (1949) (in Russian)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-014-9614-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9614-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9614-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T04:54:07Z","timestamp":1598158447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-014-9614-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,13]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["9614"],"URL":"https:\/\/doi.org\/10.1007\/s00454-014-9614-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,13]]}}}