{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:36:07Z","timestamp":1777520167106,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642367625","type":"print"},{"value":"9783642367632","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36763-2_29","type":"book-chapter","created":{"date-parts":[[2013,2,13]],"date-time":"2013-02-13T22:17:33Z","timestamp":1360793853000},"page":"327-338","source":"Crossref","is-referenced-by-count":28,"title":["On the Density of Maximal 1-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Franz J.","family":"Brandenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Glei\u00dfner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathrin","family":"Hanauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Reislhuber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Auer, C., Brandenburg, F.J., Glei\u00dfner, A., Reislhuber, J.: On 1-Planar Graphs with Rotation Systems. Tech. Rep. MIP-1207, Fakult\u00e4t f\u00fcr Informatik und Mathematik, Universit\u00e4t Passau (2012)"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02941309","volume":"53","author":"R. Bodendiek","year":"1983","unstructured":"Bodendiek, R., Schumacher, H., Wagner, K.: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg\u00a053, 41\u201352 (1983)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/mana.3211170125","volume":"117","author":"R. Bodendiek","year":"1984","unstructured":"Bodendiek, R., Schumacher, H., Wagner, K.: \u00dcber 1-optimale Graphen. Mathematische Nachrichten\u00a0117, 323\u2013339 (1984)","journal-title":"Mathematische Nachrichten"},{"issue":"4","key":"29_CR4","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. Journal of Graph Theory\u00a019(4), 507\u2013521 (1995)","journal-title":"Journal of Graph Theory"},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix De","year":"1990","unstructured":"De Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"29_CR6","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-32241-9_29","volume-title":"Computing and Combinatorics","author":"S.-H. Hong","year":"2012","unstructured":"Hong, S.-H., Eades, P., Liotta, G., Poon, S.-H.: F\u00e1ry\u2019s Theorem for 1-Planar Graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 335\u2013346. Springer, Heidelberg (2012)"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-642-25878-7_15","volume-title":"GD 2011","author":"P. Eades","year":"2012","unstructured":"Eades, P., Liotta, G.: Right Angle Crossing Graphs and 1-Planarity. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 148\u2013153. Springer, Heidelberg (2012)"},{"issue":"7-8","key":"29_CR9","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 Mathematics\u00a0307(7-8), 854\u2013865 (2007)","journal-title":"Discrete Mathematics"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-37623-2_12","volume-title":"Graph Drawing","author":"M.T. Goodrich","year":"1999","unstructured":"Goodrich, M.T., Wagner, C.G.: A Framework for Drawing Planar Graphs with Curves and Polylines. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 153\u2013166. Springer, Heidelberg (1999)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-00219-9_29","volume-title":"Graph Drawing","author":"V.P. Korzhik","year":"2009","unstructured":"Korzhik, V.P., Mohar, B.: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 302\u2013312. Springer, Heidelberg (2009)"},{"issue":"7","key":"29_CR13","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(7), 1319\u20131327 (2008)","journal-title":"Discrete Math."},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01940648","volume":"16","author":"K. Mehlhorn","year":"1995","unstructured":"Mehlhorn, K., Mutzel, P.: On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica\u00a016, 233\u2013242 (1995)","journal-title":"Algorithmica"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Nishizeki, T., Rahman, S.: Planar Graph Drawing. World Scientific (2004)","DOI":"10.1142\/5648"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs Drawn with Few Crossings per Edge. Combinatorica\u00a017, 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"29_CR17","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. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg\u00a029, 107\u2013117 (1965)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"29_CR18","unstructured":"Schnyder, W.: Embedding Planar Graphs on the Grid. In: Proc. SODA, pp. 138\u2013148 (1990)"},{"key":"29_CR19","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. Mathematische Nachrichten\u00a0125, 291\u2013300 (1986)","journal-title":"Mathematische Nachrichten"},{"issue":"1","key":"29_CR20","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.disc.2009.07.016","volume":"310","author":"Y. Suzuki","year":"2010","unstructured":"Suzuki, Y.: Optimal 1-planar Graphs which Triangulate other Surfaces. Discrete Mathematics\u00a0310(1), 6\u201311 (2010)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"29_CR21","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/090746835","volume":"24","author":"Y. Suzuki","year":"2010","unstructured":"Suzuki, Y.: Re-embeddings of Maximum 1-Planar Graphs. SIAM J. Discrete Math.\u00a024(4), 1527\u20131540 (2010)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36763-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T02:51:56Z","timestamp":1557543116000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/978-3-642-36763-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":21,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-642-36763-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}