{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:45:32Z","timestamp":1743144332096,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":62,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811565328"},{"type":"electronic","value":"9789811565335"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-6533-5_6","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:06:26Z","timestamp":1601471186000},"page":"89-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Edge Partitions and Visibility Representations of 1-planar Graphs"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Liotta","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.dam.2014.05.025","volume":"175","author":"E Ackerman","year":"2014","unstructured":"Ackerman, E.: A note on 1-planar graphs. Discret. Appl. Math. 175, 104\u2013108 (2014)","journal-title":"Discret. Appl. Math."},{"unstructured":"Alam , M.J., Brandenburg, F.J., Kobourov, S.G.: On the book thickness of 1-planar graphs (2015). CoRR, arXiv:1510.05891","key":"6_CR2"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.tcs.2019.03.029","volume":"784","author":"P Angelini","year":"2019","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Montecchiani, F.: On 3D visibility representations of graphs with few crossings per edge. Theor. Comput. Sci. 784, 11\u201320 (2019)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Arleo, A., Binucci, C., Di Giacomo, E., Evans, W.S., Grilli, L., Liotta, G., Meijer, H., Montecchiani, F., Whitesides, S., Wismath, S.K.: Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72, 19\u201333 (2018)","key":"6_CR4"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2017.08.015","volume":"232","author":"C Bachmaier","year":"2017","unstructured":"Bachmaier, C., Brandenburg, F.J., Hanauer, K., Neuwirth, D., Reislhuber, J.: NIC-planar graphs. Discret. Appl. Math. 232, 23\u201340 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.7155\/jgaa.00457","volume":"22","author":"MJ Bannister","year":"2018","unstructured":"Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. J. Graph Algorithms Appl. 22(1), 23\u201349 (2018)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s00453-016-0203-2","volume":"79","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Bruckdorfer, T., Kaufmann, M., Raftopoulou, C.N.: The book thickness of 1-planar graphs is constant. Algorithmica 79(2), 444\u2013465 (2017)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1016\/j.disc.2018.12.002","volume":"342","author":"MA Bekos","year":"2019","unstructured":"Bekos, M.A., Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F., Raftopoulou, C.: Edge partitions of optimal 2-plane and 3-plane graphs. Discret. Math. 342(4), 1038\u20131047 (2019)","journal-title":"Discret. Math."},{"issue":"5","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1137\/19M125340X","volume":"48","author":"MA Bekos","year":"2019","unstructured":"Bekos, M.A., F\u00f6rster, H., Gronemann, M., Mchedlidze, T., Montecchiani, F., Raftopoulou, C.N., Ueckerdt, T.: Planar graphs of bounded degree have bounded queue number. SIAM J. Comput. 48(5), 1487\u20131502 (2019)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s00454-017-9939-y","volume":"60","author":"TC Biedl","year":"2018","unstructured":"Biedl, T.C., Liotta, G., Montecchiani, F.: Embedding-preserving rectangle visibility representations of nonplanar graphs. Discret. Comput. Geom. 60(2), 345\u2013380 (2018)","journal-title":"Discret. Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Binucci, C., Didimo, W., Montecchiani, F.: An experimental study of a 1-planarity testing and embedding algorithm. In: WALCOM 2020, LNCS, vol. 12049, pp. 329\u2013335. Springer (2020)","key":"6_CR11","DOI":"10.1007\/978-3-030-39881-1_28"},{"doi-asserted-by":"crossref","unstructured":"R.\u00a0Bodendiek, Schumacher, H., \u00a0Wagner, K.: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel. Abhandlungen aus dem Mathematischen Seminar der Universitaet Hamburg 53(1), 41\u201352 (1983)","key":"6_CR12","DOI":"10.1007\/BF02941309"},{"key":"6_CR13","first-page":"12","volume":"108","author":"OV Borodin","year":"1984","unstructured":"Borodin, O.V.: Solution of the ringel problem on vertex-face coloring of planar graphs and coloring of $$1$$-planar graphs. Metody Diskret. Analiz 108, 12\u201326 (1984)","journal-title":"Metody Diskret. Analiz"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00006","volume":"2","author":"P Bose","year":"1998","unstructured":"Bose, P., Everett, H., Fekete, S.P., Houle, M.E., Lubiw, A., Meijer, H., Romanik, K., Rote, G., Shermer, T.C., Whitesides, S., Zelle, C.: A visibility representation for graphs in three dimensions. J. Graph Algorithms Appl. 2(3), 1\u201316 (1998)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"421","DOI":"10.7155\/jgaa.00330","volume":"18","author":"FJ Brandenburg","year":"2014","unstructured":"Brandenburg, F.J.: 1-visibility representations of 1-planar graphs. J. Graph Algorithms Appl. 18(3), 421\u2013438 (2014)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-016-0226-8","volume":"80","author":"FJ Brandenburg","year":"2018","unstructured":"Brandenburg, F.J.: Recognizing optimal 1-planar graphs in linear time. Algorithmica 80(1), 1\u201328 (2018)","journal-title":"Algorithmica"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.026","volume":"636","author":"FJ Brandenburg","year":"2016","unstructured":"Brandenburg, F.J., Didimo, W., Evans, W.S., Kindermann, P., Liotta, G., Montecchiani, F.: Recognizing and drawing ic-planar graphs. Theor. Comput. Sci. 636, 1\u201316 (2016)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Brandenburg, F.-J., Eppstein, D., \u00a0Glei\u00dfner, A., Goodrich, M.T., \u00a0Hanauer, K., Reislhuber, J.: On the density of maximal 1-planar graphs. In: GD 2012, LNCS, vol. 7704, pp. 327\u2013338. Springer (2013)","key":"6_CR18","DOI":"10.1007\/978-3-642-36763-2_29"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0095-8956(71)90065-7","volume":"10","author":"G Chartrand","year":"1971","unstructured":"Chartrand, G., Geller, D., Hedetniemi, S.: Graphs with forbidden subgraphs. J. Comb. Theory Ser. B 10(1), 12\u201341 (1971)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00453-004-1134-x","volume":"43","author":"Z Chen","year":"2005","unstructured":"Chen, Z., Kouno, M.: A linear-time algorithm for 7-coloring 1-plane graphs. Algorithmica 43(3), 147\u2013177 (2005)","journal-title":"Algorithmica"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"P54","DOI":"10.37236\/2392","volume":"20","author":"J Czap","year":"2013","unstructured":"Czap, J., Hud\u00e1k, D.: On drawings and decompositions of 1-planar graphs. Electr. J. Comb. 20(2), P54 (2013)","journal-title":"Electr. J. Comb."},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2298\/FIL1702363C","volume":"31","author":"J Czap","year":"2017","unstructured":"Czap, J., \u0160ugerek, P.: Drawing graph joins in the plane with restrictions on crossings. Filomat 31(2), 363\u2013370 (2017)","journal-title":"Filomat"},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"45","DOI":"10.7155\/jgaa.00136","volume":"11","author":"AM Dean","year":"2007","unstructured":"Dean, A.M., Evans, W.S., Gethner, E., Laison, J.D., Safari, M.A., Trotter, W.T.: Bar $$k$$-visibility graphs. J. Graph Algorithms Appl. 11(1), 45\u201359 (2007)","journal-title":"J. Graph Algorithms Appl."},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2017.12.024","volume":"713","author":"E Di Giacomo","year":"2018","unstructured":"Di Giacomo, E., Didimo, W., Evans, W.S., Liotta, G., Meijer, H., Montecchiani, F., Wismath, S.K.: New results on edge partitions of 1-plane graphs. Theor. Comput. Sci. 713, 78\u201384 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"6_CR25","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1007\/s00453-017-0324-2","volume":"80","author":"E Di Giacomo","year":"2018","unstructured":"Di Giacomo, E., Didimo, W., Evans, W.S., Liotta, G., Meijer, H., Montecchiani, F., Wismath, S.K.: Ortho-polygon visibility representations of embedded graphs. Algorithmica 80(8), 2345\u20132383 (2018)","journal-title":"Algorithmica"},{"issue":"7","key":"6_CR26","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.ipl.2013.01.013","volume":"113","author":"W Didimo","year":"2013","unstructured":"Didimo, W.: Density of straight-line 1-planar graph drawings. Inf. Process. Lett. 113(7), 236\u2013240 (2013)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 4:1\u20134:37 (2019)","key":"6_CR27","DOI":"10.1145\/3301281"},{"issue":"2","key":"6_CR28","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jctb.2000.1962","volume":"79","author":"G Ding","year":"2000","unstructured":"Ding, G., Oporowski, B., Sanders, D.P., Vertigan, D.: Surfaces, tree-width, clique-minors, and partitions. J. Comb. Theory Ser. B 79(2), 221\u2013246 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"6_CR29","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(83)90128-0","volume":"46","author":"P Duchet","year":"1983","unstructured":"Duchet, P., Hamidoune, Y.O., Vergnas, M.L., Meyniel, H.: Representing a planar graph by vertical lines joining different levels. Discret. Math. 46(3), 319\u2013321 (1983)","journal-title":"Discret. Math."},{"issue":"2","key":"6_CR30","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1137\/16M1062879","volume":"31","author":"V Dujmovi\u0107","year":"2017","unstructured":"Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Structure of graphs with locally restricted crossings. SIAM J. Discret. Math. 31(2), 805\u2013824 (2017)","journal-title":"SIAM J. Discret. Math."},{"doi-asserted-by":"crossref","unstructured":"Dujmovic, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., Wood, D.R.: Planar graphs have bounded queue-number. In: FOCS 2019. IEEE Computer Society, pp. 862\u2013875 (2019)","key":"6_CR31","DOI":"10.1109\/FOCS.2019.00056"},{"unstructured":"Elmallah, E.S., Colbourn, C.J.: Partitioning the edges of a planar graph into two partial k-trees. Congr. Num. 69\u201380 (1988)","key":"6_CR32"},{"doi-asserted-by":"crossref","unstructured":"Evans, W.S., Kaufmann, M., Lenhart, W., Mchedlidze, T., Wismath, S.K.: Bar 1-visibility graphs vs. other nearly planar graphs. J. Graph Algorithms Appl. 18(5), 721\u2013739 (2014)","key":"6_CR33","DOI":"10.7155\/jgaa.00343"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2016.06.045","volume":"645","author":"WS Evans","year":"2016","unstructured":"Evans, W.S., Liotta, G., Montecchiani, F.: Simultaneous visibility representations of plane st-graphs using l-shapes. Theor. Comput. Sci. 645, 100\u2013111 (2016)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Houle, M.E., Whitesides, S.: New results on a visibility representation of graphs in 3D. In: Brandenburg, F. (ed.) GD 1995, LNCS, vol. 1027, pp. 234\u2013241. Springer (1995)","key":"6_CR35","DOI":"10.1007\/BFb0021807"},{"issue":"1","key":"6_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195999000029","volume":"9","author":"SP Fekete","year":"1999","unstructured":"Fekete, S.P., Meijer, H.: Rectangle and box visibility graphs in 3D. Int. J. Comput. Geometry Appl. 9(1), 1\u201328 (1999)","journal-title":"Int. J. Comput. Geometry Appl."},{"doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, D.: Edge partition of planar graphs into two outerplanar graphs. In: STOC 2005, pp. 504\u2013512. ACM (2005)","key":"6_CR37","DOI":"10.1145\/1060590.1060666"},{"issue":"1","key":"6_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1\u201311 (2007)","journal-title":"Algorithmica"},{"issue":"2","key":"6_CR39","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1137\/050644240","volume":"21","author":"SG Hartke","year":"2007","unstructured":"Hartke, S.G., Vandenbussche, J., Wenger, P.S.: Further results on bar k-visibility graphs. SIAM J. Discret. Math. 21(2), 523\u2013531 (2007)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"6_CR40","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.jvlc.2014.03.001","volume":"25","author":"W Huang","year":"2014","unstructured":"Huang, W., Eades, P., Hong, S.: Larger crossing angles make graphs easier to read. J. Vis. Lang. Comput. 25(4), 452\u2013465 (2014)","journal-title":"J. Vis. Lang. Comput."},{"issue":"3","key":"6_CR41","doi-asserted-by":"publisher","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. 13(3), 161\u2013171 (1999)","journal-title":"Comput. Geom."},{"issue":"6","key":"6_CR42","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s10958-014-1690-9","volume":"196","author":"DV Karpov","year":"2014","unstructured":"Karpov, D.V.: An upper bound on the number of edges in an almost planar bipartite graph. J. Math. Sci. 196(6), 737\u2013746 (2014)","journal-title":"J. Math. Sci."},{"issue":"2","key":"6_CR43","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jctb.1996.0043","volume":"67","author":"KS Kedlaya","year":"1996","unstructured":"Kedlaya, K.S.: Outerplanar partitions of planar graphs. J. Comb. Theory Ser. B 67(2), 238\u2013248 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"key":"6_CR44","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"SG Kobourov","year":"2017","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49\u201367 (2017)","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"6_CR45","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"VP Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theory 72(1), 30\u201371 (2013)","journal-title":"J. Graph Theory"},{"issue":"3","key":"6_CR46","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1002\/jgt.20448","volume":"64","author":"D Kr\u00e1l\u2019","year":"2010","unstructured":"Kr\u00e1l\u2019, D., Stacho, L.: Coloring plane graphs with independent crossings. J. Graph Theory 64(3), 184\u2013205 (2010)","journal-title":"J. Graph Theory"},{"key":"6_CR47","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2016.12.004","volume":"662","author":"WJ Lenhart","year":"2017","unstructured":"Lenhart, W.J., Liotta, G., Montecchiani, F.: On partitioning the edges of 1-plane graphs. Theor. Comput. Sci. 662, 59\u201365 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"6_CR48","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ipl.2015.11.011","volume":"116","author":"G Liotta","year":"2016","unstructured":"Liotta, G., Montecchiani, F.: L-visibility drawings of IC-planar graphs. Inf. Process. Lett. 116(3), 217\u2013222 (2016)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Liotta, G., Montecchiani, F., Tappini, A.: Ortho-polygon visibility representations of 3-connected 1-plane graphs. In: GD 2018, LNCS, vol. 11282, pp. 524\u2013537. Springer (2018)","key":"6_CR49","DOI":"10.1007\/978-3-030-04414-5_37"},{"doi-asserted-by":"crossref","unstructured":"Nash-Williams, C.S.A.: Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. s1-36(1), 445\u2013450 (1961)","key":"6_CR50","DOI":"10.1112\/jlms\/s1-36.1.445"},{"issue":"3","key":"6_CR51","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/j.ejc.2011.09.008","volume":"33","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O., Wood, D.R.: Characterisations and examples of graph classes with bounded expansion. Eur. J. Comb. 33(3), 350\u2013373 (2012)","journal-title":"Eur. J. Comb."},{"unstructured":"Otten, R.H.J.M., Wijk, J.G.V.: Graph representations in interactive layout design. In: IEEE ISCSS, pp. 914\u2013918. IEEE (1978)","key":"6_CR52"},{"issue":"3","key":"6_CR53","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 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"6_CR54","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discret. Comput. Geom. 1, 343\u2013353 (1986)","journal-title":"Discret. Comput. Geom."},{"unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Johnson, D.S. (ed.) SODA 1990, pp. 138\u2013148. SIAM (1990)","key":"6_CR55"},{"doi-asserted-by":"crossref","unstructured":"Shermer, T.C.: On rectangle visibility graphs. III. External visibility and complexity. In: CCCG 1996, pp. 234\u2013239. Carleton University Press (1996)","key":"6_CR56","DOI":"10.1515\/9780773591134-041"},{"doi-asserted-by":"crossref","unstructured":"\u0160tola, J.: Unimaximal sequences of pairs in rectangle visibility drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008, LNCS, vol. 5417, pp. 61\u201366. Springer (2009)","key":"6_CR57","DOI":"10.1007\/978-3-642-00219-9_7"},{"issue":"1","key":"6_CR58","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. Discret. Math. 310(1), 6\u201311 (2010)","journal-title":"Discret. Math."},{"issue":"1","key":"6_CR59","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discret. Comput. Geom. 1(1), 321\u2013341 (1986)","journal-title":"Discret. Comput. Geom."},{"unstructured":"Thomassen, C.: Plane representations of graphs. In: Progress in Graph Theory, pp. 43\u201369. AP (1984)","key":"6_CR60"},{"doi-asserted-by":"crossref","unstructured":"Wismath, S.K.: Characterizing bar line-of-sight graphs. In: SoCG 1985, pp. 147\u2013152. ACM (1985)","key":"6_CR61","DOI":"10.1145\/323233.323253"},{"issue":"2","key":"6_CR62","doi-asserted-by":"publisher","first-page":"308","DOI":"10.2478\/s11533-012-0094-7","volume":"11","author":"X Zhang","year":"2013","unstructured":"Zhang, X., Liu, G.: The structure of plane graphs with independent crossings and its applications to coloring problems. Open Math. 11(2), 308\u2013321 (2013)","journal-title":"Open Math."}],"container-title":["Beyond Planar Graphs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-6533-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,8]],"date-time":"2023-10-08T19:08:54Z","timestamp":1696792134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-6533-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811565328","9789811565335"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-6533-5_6","relation":{},"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}