{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:37:30Z","timestamp":1766378250039},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_29","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T11:12:12Z","timestamp":1344856332000},"page":"335-346","source":"Crossref","is-referenced-by-count":36,"title":["F\u00e1ry\u2019s Theorem for 1-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Seok-Hee","family":"Hong","sequence":"first","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0166-218X(00)00359-0","volume":"114","author":"O.V. Borodin","year":"2001","unstructured":"Borodin, O.V., Kostochka, A.V., Raspaud, A., Sopena, E.: Acyclic colouring of 1-planar graphs. Discrete Applied Mathematics\u00a0114(1-3), 29\u201341 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR2","unstructured":"Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear time algorithms for convex drawings of planar graphs. In: Progress in Graph Theory, pp. 153\u2013173. Academic Press (1984)"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","volume":"86","author":"M. Chrobak","year":"1991","unstructured":"Chrobak, M., Eppstein, D.: Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. Theor. Comput. Sci.\u00a086(2), 243\u2013266 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"7-8","key":"29_CR4","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"},{"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)"},{"issue":"5","key":"29_CR7","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. on Comput.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. on Comput."},{"key":"29_CR8","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representations of planar graphs. Acta Sci. Math. Szeged\u00a011, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. Szeged"},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.comgeo.2009.06.008","volume":"43","author":"S. Hong","year":"2010","unstructured":"Hong, S., Nagamochi, H.: An algorithm for constructing star-shaped drawings of plane graphs. Comput. Geom.\u00a043(2), 191\u2013206 (2010)","journal-title":"Comput. Geom."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. on Comput.\u00a02, 135\u2013158 (1973)","journal-title":"SIAM J. on Comput."},{"key":"29_CR11","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)"},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K. Kuratowski","year":"1930","unstructured":"Kuratowski, K.: Sur le problme des courbes gauches en topologie. Fund. Math.\u00a015, 271\u2013283 (1930)","journal-title":"Fund. Math."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific (2004)","DOI":"10.1142\/5648"},{"issue":"3","key":"29_CR14","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"Pach, J., Toth, G.: Graphs drawn with few crossings per edge. Combinatorica\u00a017(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"29_CR15","first-page":"31","volume":"56","author":"R.C. Read","year":"1987","unstructured":"Read, R.C.: A new method for drawing a planar graph given the cyclic order of the edges at each vertex. Congr. Numer.\u00a056, 31\u201344 (1987)","journal-title":"Congr. Numer."},{"issue":"1","key":"29_CR16","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"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. of the London Mathematical Society\u00a013, 743\u2013767 (1963)","journal-title":"Proc. of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:58:53Z","timestamp":1620115133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}