{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:27:52Z","timestamp":1760441272894},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,26]],"date-time":"2015-02-26T00:00:00Z","timestamp":1424908800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s00373-015-1546-1","type":"journal-article","created":{"date-parts":[[2015,2,25]],"date-time":"2015-02-25T15:09:39Z","timestamp":1424876979000},"page":"407-425","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Geometric Biplane Graphs I: Maximal Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Alfredo","family":"Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"In\u00eas","family":"Matos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Saumell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Tejel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,26]]},"reference":[{"issue":"3","key":"1546_CR1","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.comgeo.2007.09.001","volume":"40","author":"M Abellanas","year":"2008","unstructured":"Abellanas, M., Garc\u00eda, A., Hurtado, F., Tejel, J., Urrutia, J.: Augmenting the connectivity of geometric graphs. Comput. Geom. Theory Appl. 40(3), 220\u2013230 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"key":"1546_CR2","first-page":"9","volume":"12","author":"M Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M.M., Szemer\u00e9di, E.: Crossing-free subgraphs. Ann. Discret. Math. 12, 9\u201312 (1982)","journal-title":"Ann. Discret. Math."},{"key":"1546_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-1-4614-0110-0_5","volume-title":"Thirty Essays on Geometric Graph Theory","author":"M Al-Jubeh","year":"2013","unstructured":"Al-Jubeh, M., Barequet, G., Ishaque, M., Souvaine, D.L., T\u00f3th, C.D., Winslow, A.: Constrained tri-connected planar straight line graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 49\u201370. Springer, New York (2013)"},{"issue":"4","key":"1546_CR4","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1007\/s00453-011-9551-0","volume":"61","author":"M Al-Jubeh","year":"2011","unstructured":"Al-Jubeh, M., Ishaque, M., R\u00e9dei, K., Souvaine, D.L., T\u00f3th, C.D., Valtr, P.: Augmenting the edge connectivity of planar straight line graphs to three. Algorithmica 61(4), 971\u2013999 (2011)","journal-title":"Algorithmica"},{"key":"1546_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(74)90035-1","volume":"7","author":"D Barnette","year":"1974","unstructured":"Barnette, D.: On generating planar graphs. Discret. Math. 7, 199\u2013208 (1974)","journal-title":"Discret. Math."},{"issue":"11","key":"1546_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0898-1221(97)00214-9","volume":"34","author":"LW Beineke","year":"1997","unstructured":"Beineke, L.W.: Biplanar Graphs: a survey. Comput. Math. Appl. 34(11), 1\u20138 (1997)","journal-title":"Comput. Math. Appl."},{"issue":"11","key":"1546_CR7","doi-asserted-by":"crossref","first-page":"2910","DOI":"10.1021\/ci3003107","volume":"52","author":"G Brinkmann","year":"2012","unstructured":"Brinkmann, G., Goedgebeur, J., McKay, B.D.: The generation of fullerenes. J. Chem. Inf. Model. 52(11), 2910\u20132918 (2012)","journal-title":"J. Chem. Inf. Model."},{"key":"1546_CR8","volume-title":"Graphs and Digraphs","author":"G Chartrand","year":"2005","unstructured":"Chartrand, G., Lesniak, L.: Graphs and Digraphs. Chapman and Hall\/CRC, Boca Raton (2005)"},{"issue":"3","key":"1546_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7155\/jgaa.00023","volume":"4","author":"MB Dillencourt","year":"2000","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Algorithms Appl. 4(3), 5\u201317 (2000)","journal-title":"J. Graph Algorithms Appl."},{"key":"1546_CR10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1023299815308","volume":"33","author":"T Doslic","year":"2003","unstructured":"Doslic, T.: Cyclical edge-connectivity of fullerene graphs and $$(k, 6)$$ ( k , 6 ) -cages. J. Math. Chem. 33, 103\u2013112 (2003)","journal-title":"J. Math. Chem."},{"key":"1546_CR11","doi-asserted-by":"crossref","unstructured":"Eades, P., Hong, S.-H., Liotta, G., Poon, S.-H.: F\u00e1ry\u2019s theorem for 1-planar graphs. In: Proceedings of 18th COCOON, LNCS 7434, pp. 335\u2013346. Springer, New York (2012)","DOI":"10.1007\/978-3-642-32241-9_29"},{"issue":"2","key":"1546_CR12","doi-asserted-by":"crossref","first-page":"article 15","DOI":"10.1145\/1497290.1497291","volume":"5","author":"D Eppstein","year":"2009","unstructured":"Eppstein, D.: Testing bipartiteness of geometric intersection graphs. ACM Trans. Algorithms 5(2), article 15 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"1546_CR13","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight-line representation of planar graphs. Acta Sci. Math. (Szeged) 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"1546_CR14","unstructured":"Garc\u00eda, A., Hurtado, F., Korman, M., Matos, I., Saumell, M., Silveira, R.I., Tejel, J., T\u00f3th, C.D.: Geometric biplane graphs I: maximal graphs. Extended abstract. In: Proceedings of Mexican conference on discrete mathematics and computational geometry, Oaxaca, M\u00e9xico, pp. 123\u2013134 (2013)"},{"key":"1546_CR15","unstructured":"Garc\u00eda, A., Hurtado, F., Korman, M., Matos, I., Saumell, M., Silveira, R.I., Tejel, J., T\u00f3th, C.D.: Geometric biplane graphs II: graph augmentation. Extended abstract. In: Proceedings of Mexican conference on discrete mathematics and computational geometry, Oaxaca, M\u00e9xico, pp. 223\u2013234 (2013)"},{"issue":"2","key":"1546_CR16","first-page":"309","volume":"22","author":"O Gim\u00e9nez","year":"2009","unstructured":"Gim\u00e9nez, O., Noy, M.: Asymptotic enumeration and limit laws of planar graphs. J. AMS 22(2), 309\u2013329 (2009)","journal-title":"J. AMS"},{"key":"1546_CR17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-1-4614-0110-0_16","volume-title":"Thirty Essays on Geometric Graph Theory","author":"M Hoffmann","year":"2013","unstructured":"Hoffmann, M., Schulz, A., Sharir, M., Sheffer, A., T\u00f3th, C.D., Welzl, E.: Counting plane graphs: flippability and its applications. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 303\u2013326. Springer, New York (2013)"},{"key":"1546_CR18","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-1-4614-0110-0_17","volume-title":"Thirty Essays on Geometric Graph Theory","author":"F Hurtado","year":"2013","unstructured":"Hurtado, F., T\u00f3th, C.D.: Plane geometric graph augmentation: a generic perspective. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 327\u2013354. Springer, New York (2013)"},{"key":"1546_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","volume":"13","author":"JP Hutchinson","year":"1999","unstructured":"Hutchinson, J.P., Shermer, T.C., Vince, A.: On representations of some thickness-two graphs. Comput. Geom. Theory Appl. 13, 161\u2013171 (1999)","journal-title":"Comput. Geom. Theory Appl."},{"key":"1546_CR20","doi-asserted-by":"crossref","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. In: Proceedings of 16th graph drawing, LNCS 5417, pp. 302\u2013312. Springer, New York (2009)","DOI":"10.1007\/978-3-642-00219-9_29"},{"key":"1546_CR21","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","volume":"1","author":"DT Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Generalized Delaunay triangulation for planar graphs. Discret. Comput. Geom. 1, 201\u2013217 (1986)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"1546_CR22","doi-asserted-by":"crossref","first-page":"599","DOI":"10.7155\/jgaa.00275","volume":"16","author":"I Rutter","year":"2012","unstructured":"Rutter, I., Wolff, A.: Augmenting the connectivity of planar and geometric graphs. J. Graph Algorithms Appl. 16(2), 599\u2013628 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"1546_CR23","unstructured":"Sharir, M., Sheffer, A.: Counting triangulations of planar point sets. Electron. J. Comb. 18(1), 1\u201374 (2011)"},{"issue":"3","key":"1546_CR24","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejc.2011.09.002","volume":"33","author":"CD T\u00f3th","year":"2012","unstructured":"T\u00f3th, C.D.: Connectivity augmentation in planar straight line graphs. Eur. J. Comb. 33(3), 408\u2013425 (2012)","journal-title":"Eur. J. Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1546-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1546-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1546-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T07:35:55Z","timestamp":1566372955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1546-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,26]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["1546"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1546-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,26]]}}}