{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:21:39Z","timestamp":1770067299323,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642450426","type":"print"},{"value":"9783642450433","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_21","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T09:05:50Z","timestamp":1384247150000},"page":"237-248","source":"Crossref","is-referenced-by-count":2,"title":["Thickness and Colorability of Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Stephane","family":"Durocher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ellen","family":"Gethner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1021231927255","volume":"19","author":"O. Aichholzer","year":"2002","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: Enumerating order types for small point sets with applications. Order\u00a019(3), 265\u2013281 (2002)","journal-title":"Order"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1070\/SM1976v030n02ABEH002267","volume":"30","author":"V.B. Alekseev","year":"1976","unstructured":"Alekseev, V.B., Gonchakov, V.S.: Thickness of arbitrary complete graphs. Math USSR Sbornik\u00a030(2), 187\u2013202 (1976)","journal-title":"Math USSR Sbornik"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"K. Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. Part I. Discharging. Illinois Journal of Mathematics\u00a021, 429\u2013490 (1977)","journal-title":"Illinois Journal of Mathematics"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bar\u00e1t, J., Matou\u0161ek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electronic Journal of Combinatorics\u00a013 (2006)","DOI":"10.37236\/1029"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0305004100037385","volume":"60","author":"L.W. Beineke","year":"1964","unstructured":"Beineke, L.W., Harary, F., Moon, J.W.: On the thickness of the complete bipartite graph. Math. Proc. of the Cambridge Philosophical Society\u00a060, 1\u20136 (1964)","journal-title":"Math. Proc. of the Cambridge Philosophical Society"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-24595-7_55","volume-title":"Graph Drawing","author":"F.-J. Brandenburg","year":"2004","unstructured":"Brandenburg, F.-J., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 515\u2013539. Springer, Heidelberg (2004)"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00023","volume":"4","author":"M.B. Dillencourt","year":"2000","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. Journal of Graph Algorithms and Applications\u00a04(3), 5\u201317 (2000)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00454-007-1318-7","volume":"37","author":"V. Dujmovic","year":"2007","unstructured":"Dujmovic, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. Discrete & Computational Geometry\u00a037(4), 641\u2013670 (2007)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.comgeo.2010.09.005","volume":"44","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A.: On graph thickness, geometric thickness, and separator theorems. Computational Geometry: Theory and Applications\u00a044(2), 95\u201399 (2011)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: Proc. of SoCG, pp. 340\u2013346. ACM (2004)","DOI":"10.1145\/997817.997868"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-36151-0_15","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2002","unstructured":"Eppstein, D.: Separating thickness from geometric thickness. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 150\u2013161. Springer, Heidelberg (2002)"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.7155\/jgaa.00113","volume":"9","author":"C. Erten","year":"2005","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. Journal Graph Algorithms and Applications\u00a09(3), 347\u2013364 (2005)","journal-title":"Journal Graph Algorithms and Applications"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-77537-9_28","volume-title":"Graph Drawing","author":"A. Estrella-Balderrama","year":"2008","unstructured":"Estrella-Balderrama, A., Gassner, E., J\u00fcnger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous geometric graph embeddings. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 280\u2013290. Springer, Heidelberg (2008)"},{"issue":"3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","volume":"13","author":"J.P. Hutchinson","year":"1999","unstructured":"Hutchinson, J.P., Shermer, T.C., Vince, A.: On representations of some thickness-two graphs. Comp. Geom.: Theory and Applications\u00a013(3), 161\u2013171 (1999)","journal-title":"Comp. Geom.: Theory and Applications"},{"key":"21_CR15","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Graph coloring problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York (1995)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Kainen, P.C.: Thickness and coarseness of graphs. Abhandlungen aus dem Mathematischen Seminar der Univ. Hamburg\u00a039(88\u201395) (1973)","DOI":"10.1007\/BF02992822"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Mansfield, A.: Determining the thickness of a graph is NP-hard. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol.\u00a093, pp. 9\u201323 (1983)","DOI":"10.1017\/S030500410006028X"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"McGrae, A.R.A., Zito, M.: The complexity of the empire colouring problem. Algorithmica, 1\u201321 (2012) (published online)","DOI":"10.1007\/s00453-012-9680-0"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P. Mutzel","year":"1998","unstructured":"Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: A survey. Graphs Combin.\u00a014, 59\u201373 (1998)","journal-title":"Graphs Combin."},{"key":"21_CR20","unstructured":"Ringel, G.: Fabungsprobleme auf flachen und graphen. VEB Deutscher Verlag der Wissenschaften (1950)"},{"key":"21_CR21","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/S1385-7258(63)50055-9","volume":"25","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: The thickness of a graph. Indag. Math.\u00a025, 567\u2013577 (1963)","journal-title":"Indag. Math."},{"issue":"1","key":"21_CR22","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. American Journal of Mathematics\u00a054(1), 150\u2013168 (1932)","journal-title":"American Journal of Mathematics"}],"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-642-45043-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T16:03:33Z","timestamp":1596816213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}