{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:55:14Z","timestamp":1758264914163},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_29","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T13:03:51Z","timestamp":1233752631000},"page":"302-312","source":"Crossref","is-referenced-by-count":13,"title":["Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing"],"prefix":"10.1007","author":[{"given":"Vladimir P.","family":"Korzhik","sequence":"first","affiliation":[]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","first-page":"12","volume":"41","author":"O.V. Borodin","year":"1984","unstructured":"Borodin, O.V.: Solution of Ringel\u2019s problem about vertex bound colouring of planar graphs and colouring of 1-planar graphs [in Russian]. Metody Discret. Analiz.\u00a041, 12\u201326 (1984)","journal-title":"Metody Discret. Analiz."},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1002\/jgt.3190190406","volume":"19","author":"O.V. Borodin","year":"1995","unstructured":"Borodin, O.V.: A new proof of the 6-color theorem. J. Graph Theory\u00a019, 507\u2013521 (1995)","journal-title":"J. Graph Theory"},{"key":"29_CR3","first-page":"20","volume":"6","author":"O.V. Borodin","year":"1999","unstructured":"Borodin, O.V., Kostochka, A.V., Raspaud, A., Sopena, E.: Acyclic colouring of 1-planar graphs. Discrete Analysis and Operations Researcher\u00a06, 20\u201335 (1999)","journal-title":"Discrete Analysis and Operations Researcher"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jagm.2001.1178","volume":"41","author":"Z.-Z. Chen","year":"2001","unstructured":"Chen, Z.-Z.: Approximation algorithms for independent sets in map graphs. Journal of Algorithms\u00a041, 20\u201340 (2001)","journal-title":"Journal of Algorithms"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-27798-9_35","volume-title":"Computing and Combinatorics","author":"Z.-Z. Chen","year":"2004","unstructured":"Chen, Z.-Z.: New bounds on the number of edges in a k-map graph. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 319\u2013328. Springer, Heidelberg (2004)"},{"key":"29_CR6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s00453-004-1134-x","volume":"43","author":"Z.-Z. Chen","year":"2005","unstructured":"Chen, Z.-Z., Kouno M.: A linear-time algorithm for 7-coloring 1-plane graphs. Algorithmica 43, 147\u2013177 (2005)","journal-title":"Algorithmica"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.disc.2005.11.056","volume":"307","author":"I. Fabrici","year":"2007","unstructured":"Fabrici, I., Madaras, T.: The structure of 1-planar graphs. Discrete Math.\u00a0307, 854\u2013865 (2007)","journal-title":"Discrete Math."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comp. Sci.\u00a01, 237\u2013267 (1976)","journal-title":"Theor. Comp. Sci."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.jctb.2005.09.009","volume":"96","author":"P. Hlin\u011bn\u00fd","year":"2006","unstructured":"Hlin\u011bn\u00fd, P.: Crossing number is hard for cubic graphs. J. Combin. Theory, Ser.\u00a0B\u00a096, 455\u2013471 (2006)","journal-title":"J. Combin. Theory, Ser.\u00a0B"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.disc.2007.04.009","volume":"308","author":"V.P. Korzhik","year":"2008","unstructured":"Korzhik, V.P.: Minimal non-1-planar graphs. Discrete Math.\u00a0308, 1319\u20131327 (2008)","journal-title":"Discrete Math."},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G. Ringel","year":"1965","unstructured":"Ringel, G.: Ein Sechsfarbenproblem auf der Kugel. Abh. Sem. Univ. Hamburg\u00a029, 107\u2013117 (1965)","journal-title":"Abh. Sem. Univ. Hamburg"},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/mana.19861250122","volume":"125","author":"H. Schumacher","year":"1986","unstructured":"Schumacher, H.: Zur Struktur 1-planarer Graphen. Math. Nachr.\u00a0125, 291\u2013300 (1986)","journal-title":"Math. Nachr."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T05:14:42Z","timestamp":1551762882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}