{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:21:29Z","timestamp":1743074489811,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":75,"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_2","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:06:26Z","timestamp":1601471186000},"page":"11-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantitative Restrictions on Crossing Patterns"],"prefix":"10.1007","author":[{"given":"Csaba D.","family":"T\u00f3th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B.M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Hackl, T., Pammer, J., Pilz, A., Ramos, P., Salazar, G., Vogtenhuber, B.: All good drawings of small complete graphs. In: Book of Abstracts of the 31st European Workshop on Computational Geometry (EuroCG), pp. 57\u201360, Ljubljana (2015)","DOI":"10.1007\/s00373-015-1550-5"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jcta.2017.04.003","volume":"151","author":"BM \u00c1brego","year":"2017","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S.: The rectilinear local crossing number of $$K_n$$. J. Comb. Theory Ser. A 151, 131\u2013145 (2017). \nhttps:\/\/doi.org\/10.1016\/j.jcta.2017.04.003","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00454-009-9143-9","volume":"41","author":"E Ackerman","year":"2009","unstructured":"Ackerman, E.: On the maximum number of edges in topological graphs with no four pairwise crossing edges. Discret. Comput. Geom. 41(3), 365\u2013375 (2009). \nhttps:\/\/doi.org\/10.1007\/s00454-009-9143-9","journal-title":"Discret. Comput. Geom."},{"key":"2_CR4","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). \nhttps:\/\/doi.org\/10.1016\/j.dam.2014.05.025","journal-title":"Discret. Appl. Math."},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Ackerman, E.: On topological graphs with at most four crossings per edge. Comput. Geom. 85 (2019). \nhttps:\/\/doi.org\/10.1016\/j.comgeo.2019.101574","DOI":"10.1016\/j.comgeo.2019.101574"},{"issue":"7","key":"2_CR6","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1016\/j.comgeo.2014.02.003","volume":"47","author":"E Ackerman","year":"2014","unstructured":"Ackerman, E., Fox, J., Pach, J., Suk, A.: On grids in topological graphs. Comput. Geom. 47(7), 710\u2013723 (2014). \nhttps:\/\/doi.org\/10.1016\/j.comgeo.2014.02.003","journal-title":"Comput. Geom."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.7155\/jgaa.00453","volume":"22","author":"E Ackerman","year":"2018","unstructured":"Ackerman, E., Keszegh, B., Vizer, M.: On the size of planarly connected crossing graphs. J. Graph Algorithms Appl. 22(1), 11\u201322 (2018). \nhttps:\/\/doi.org\/10.7155\/jgaa.00453","journal-title":"J. Graph Algorithms Appl."},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Comb. Theory Ser. A 114(3), 563\u2013571 (2007). \nhttps:\/\/doi.org\/10.1016\/j.jcta.2006.08.002","DOI":"10.1016\/j.jcta.2006.08.002"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Angelini, P., Bekos, M.A., Brandenburg, F.J., Da Lozzo, G., Di Battista, G., Didimo, W., Hoffmann, M., Liotta, G., Montecchiani, F., Rutter, I., T\u00f3th, C.D.: Simple $$k$$-planar graphs are simple $$(k+1)$$-quasiplanar. J. Comb. Theory Ser. B 142, 1\u201335 (2020). \nhttps:\/\/doi.org\/10.1016\/j.jctb.2019.08.006","DOI":"10.1016\/j.jctb.2019.08.006"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Appel, A., Rohlf, F.J., Stein, A.J.: The haloed line effect for hidden line elimination. SIGGRAPH Comput. Graph. 13(2), 151\u2013157 (1979). \nhttps:\/\/doi.org\/10.1145\/965103.807437","DOI":"10.1145\/965103.807437"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.7155\/jgaa.00347","volume":"19","author":"C Auer","year":"2015","unstructured":"Auer, C., Brandenburg, F.J., Glei\u00dfner, A., Reislhuber, J.: 1-planarity of graphs with a rotation system. J. Graph Algorithms Appl. 19(1), 67\u201386 (2015). \nhttps:\/\/doi.org\/10.7155\/jgaa.00347","journal-title":"J. Graph Algorithms Appl."},{"key":"2_CR12","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). \nhttps:\/\/doi.org\/10.1016\/j.dam.2017.08.015","journal-title":"Discret. Appl. Math."},{"key":"2_CR13","unstructured":"Bachmaier, C., Rutter, I., Stumpf, P.: 1-gap planarity of complete bipartite graphs (Poster). In: Biedl, T.C., Kerren, A. (eds.) Proceedings of 26th Symposium on Graph Drawing and Network Visualization. LNCS, vol. 11282. Springer, Cham (2018)"},{"key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.05.029","author":"SW Bae","year":"2018","unstructured":"Bae, S.W., Baffier, J.F., Chun, J., Eades, P., Eickmeyer, K., Grilli, L., Hong, S.H., Korman, M., Montecchiani, F., Rutter, I., T\u00f3th, C.D.: Gap-planar graphs. Theor. Comput. Sci. (2018). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2018.05.029","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2_CR15","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). \nhttps:\/\/doi.org\/10.7155\/jgaa.00457","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.22187","volume":"88","author":"J Bar\u00e1t","year":"2018","unstructured":"Bar\u00e1t, J., T\u00f3th, G.: Improvements on the density of maximal 1-planar graphs. J. Graph Theory 88(1), 101\u2013109 (2018). \nhttps:\/\/doi.org\/10.1002\/jgt.22187","journal-title":"J. Graph Theory"},{"issue":"2","key":"2_CR17","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). \nhttps:\/\/doi.org\/10.1007\/s00453-016-0203-2","journal-title":"Algorithmica"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: Aronov, B., Katz, M.J. (eds.) 33rd International Symposium on Computational Geometry (SoCG). LIPIcs, vol. 77, pp. 16:1\u201316:16. Schloss Dagstuhl, Dagstuhl (2017). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.16\n\n. \nhttp:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/7230","DOI":"10.4230\/LIPIcs.SoCG.2017.16"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Bodendiek, R., Schumacher, H., Wagner, K.: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel. Abh. Math. Semin. Univ. Hambg. 53(1), 41\u201352 (1983). \nhttps:\/\/doi.org\/10.1007\/BF02941309","DOI":"10.1007\/BF02941309"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976). \nhttps:\/\/doi.org\/10.1016\/S0022-0000(76)80045-1","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR21","first-page":"12","volume":"41","author":"OV Borodin","year":"1984","unstructured":"Borodin, O.V.: Solution of Ringel\u2019s problems on the vertex-face coloring of plane graphs and on the coloring of 1-planar graphs. Diskret. Analiz 41, 12\u201326 (1984). (in Russian)","journal-title":"Diskret. Analiz"},{"issue":"4","key":"2_CR22","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1002\/jgt.3190190406","volume":"19","author":"OV Borodin","year":"1995","unstructured":"Borodin, O.V.: A new proof of the 6 color theorem. J. Graph Theory 19(4), 507\u2013521 (1995). \nhttps:\/\/doi.org\/10.1002\/jgt.3190190406","journal-title":"J. Graph Theory"},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"JM Boyer","year":"2004","unstructured":"Boyer, J.M., Myrvold, W.J.: On the cutting edge: simplified $$O(n)$$ planarity by edge addition. J. Graph Algorithms Appl. 8(3), 241\u2013273 (2004). \nhttps:\/\/doi.org\/10.7155\/jgaa.00091","journal-title":"J. Graph Algorithms Appl."},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Brandenburg, F., Eppstein, D., Glei\u00dfner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the density of maximal 1-planar graphs. In: Didimo, W., Patrignani, M. (eds.) Proceedings of 20th Symposium on Graph Drawing (GD). LNCS, vol. 7704, pp. 327\u2013338. Springer (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-36763-2_29","DOI":"10.1007\/978-3-642-36763-2_29"},{"issue":"1","key":"2_CR25","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). \nhttps:\/\/doi.org\/10.1007\/s00453-016-0226-8","journal-title":"Algorithmica"},{"issue":"5","key":"2_CR26","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/120872310","volume":"42","author":"S Cabello","year":"2013","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803\u20131829 (2013). \nhttps:\/\/doi.org\/10.1137\/120872310","journal-title":"SIAM J. Comput."},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.comgeo.2017.06.001","volume":"68","author":"J Cardinal","year":"2018","unstructured":"Cardinal, J., Hoffmann, M., Kusters, V., T\u00f3th, C.D., Wettstein, M.: Arc diagrams, flip distances, and Hamiltonian triangulations. Comput. Geom. 68, 206\u2013225 (2018). \nhttps:\/\/doi.org\/10.1016\/j.comgeo.2017.06.001","journal-title":"Comput. Geom."},{"issue":"2","key":"2_CR28","doi-asserted-by":"publisher","first-page":"243","DOI":"10.7155\/jgaa.00257","volume":"16","author":"EW Chambers","year":"2012","unstructured":"Chambers, E.W., Eppstein, D., Goodrich, M.T., L\u00f6ffler, M.: Drawing graphs in the plane with a prescribed outer face and polynomial area. J. Graph Algorithms Appl. 16(2), 243\u2013259 (2012). \nhttps:\/\/doi.org\/10.7155\/jgaa.00257","journal-title":"J. Graph Algorithms Appl."},{"key":"2_CR29","unstructured":"Colin de Verdi\u00e8re, \u00c9.: Computational topology of graphs on surfaces. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C.D. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn, Chap. 23, pp. 605\u2013636. CRC Press, Boca Raton (2017)"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Colin de Verdi\u00e8re, \u00c9., Erickson, J.: Tightening nonsimple paths and cycles on surfaces. SIAM J. Comput. 39(8), 3784\u20133813 (2010). \nhttps:\/\/doi.org\/10.1137\/090761653","DOI":"10.1137\/090761653"},{"issue":"2","key":"2_CR31","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). \nhttps:\/\/doi.org\/10.1137\/16M1062879","journal-title":"SIAM J. Discret. Math"},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2013.09.029","volume":"513","author":"P Eades","year":"2013","unstructured":"Eades, P., Hong, S.H., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. 513, 65\u201376 (2013). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2013.09.029","journal-title":"Theor. Comput. Sci."},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Eppstein, D., Gupta, S.: Crossing patterns in nonplanar road networks. In: Proceedings of 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 40:1\u201340:9. ACM, New York, NY (2017). \nhttps:\/\/doi.org\/10.1145\/3139958.3139999","DOI":"10.1145\/3139958.3139999"},{"issue":"8","key":"2_CR34","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1016\/j.comgeo.2008.05.005","volume":"42","author":"D Eppstein","year":"2009","unstructured":"Eppstein, D., van Kreveld, M.J., Mumford, E., Speckmann, B.: Edges and switches, tunnels and bridges. Comput. Geom. 42(8), 790\u2013802 (2009). \nhttps:\/\/doi.org\/10.1016\/j.comgeo.2008.05.005","journal-title":"Comput. Geom."},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Fox, J., Pach, J.: Applications of a new separator theorem for string graphs. Comb. Probab. Comput. 23(1), 66\u201374 (2014). \nhttps:\/\/doi.org\/10.1017\/S0963548313000412","DOI":"10.1017\/S0963548313000412"},{"key":"2_CR36","unstructured":"Frati, F.: A lower bound on the diameter of the flip graph. Electron. J. Comb. 24(1), P1.43 (2017). \nhttp:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i1p43"},{"key":"2_CR37","unstructured":"Fulek, R., Kyn\u010dl, J., P\u00e1lv\u00f6lgyi, D.: Unified Hanani-Tutte theorem. Electron. J. Comb. 24(3), P3.18 (2017). \nhttp:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i3p18"},{"issue":"1","key":"2_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). \nhttps:\/\/doi.org\/10.1007\/s00453-007-0010-x","journal-title":"Algorithmica"},{"issue":"1","key":"2_CR39","doi-asserted-by":"publisher","first-page":"117","DOI":"10.7155\/jgaa.00460","volume":"22","author":"P Hajnal","year":"2018","unstructured":"Hajnal, P., Igamberdiev, A., Rote, G., Schulz, A.: Saturated simple and 2-simple topological graphs with few edges. J. Graph Algorithms Appl. 22(1), 117\u2013138 (2018). \nhttps:\/\/doi.org\/10.7155\/jgaa.00460","journal-title":"J. Graph Algorithms Appl."},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Hong, S., Nagamochi, H.: Re-embedding a 1-plane graph into a straight-line drawing in linear time. In: Hu, Y., N\u00f6llenburg, M. (eds.) Proceedings of 24th Symposium on Graph Drawing and Network Visualization (GD). LNCS, vol. 9801, pp. 321\u2013334. Springer (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-50106-2_25","DOI":"10.1007\/978-3-319-50106-2_25"},{"key":"2_CR41","doi-asserted-by":"publisher","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.) Proceedings of 18th Computing and Combinatorics Conference (COCOON), pp. 335\u2013346. Springer, Berlin (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-32241-9_29","DOI":"10.1007\/978-3-642-32241-9_29"},{"issue":"4","key":"2_CR42","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974). \nhttps:\/\/doi.org\/10.1145\/321850.321852","journal-title":"J. ACM"},{"key":"2_CR43","doi-asserted-by":"publisher","unstructured":"Kaufmann, M., Pach, J., T\u00f3th, G., Ueckerdt, T.: The number of crossings in multigraphs with no empty lens. In: Biedl, T.C., Kerren, A. (eds.) Proceedings of 26th Symposium on Graph Drawing and Network Visualization (GD). LNCS, vol. 11282, pp. 242\u2013254. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-04414-5_17","DOI":"10.1007\/978-3-030-04414-5_17"},{"key":"2_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). \nhttps:\/\/doi.org\/10.1016\/j.cosrev.2017.06.002","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"2_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). \nhttps:\/\/doi.org\/10.1002\/jgt.21630","journal-title":"J. Graph Theory"},{"issue":"4","key":"2_CR46","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.comgeo.2014.10.008","volume":"48","author":"J Kyn\u010dl","year":"2015","unstructured":"Kyn\u010dl, J., Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: Saturated simple and $$k$$-simple topological graphs. Comput. Geom. 48(4), 295\u2013310 (2015). \nhttps:\/\/doi.org\/10.1016\/j.comgeo.2014.10.008","journal-title":"Comput. Geom."},{"issue":"7","key":"2_CR47","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1016\/j.ejc.2009.03.005","volume":"30","author":"J Kyn\u010dl","year":"2009","unstructured":"Kyn\u010dl, J.: Enumeration of simple complete topological graphs. Eur. J. Comb. 30(7), 1676\u20131685 (2009). \nhttps:\/\/doi.org\/10.1016\/j.ejc.2009.03.005","journal-title":"Eur. J. Comb."},{"key":"2_CR48","doi-asserted-by":"publisher","unstructured":"Kyn\u010dl, J.: Simple realizability of complete abstract topological graphs simplified. In: Giacomo, E.D., Lubiw, A. (eds.) Proceedings of 23rd Symposium on Graph Drawing and Network Visualization (GD). LNCS, vol. 9411, pp. 309\u2013320. Springer (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27261-0_26","DOI":"10.1007\/978-3-319-27261-0_26"},{"issue":"7","key":"2_CR49","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1016\/j.disc.2008.03.005","volume":"309","author":"J Kyn\u010dl","year":"2009","unstructured":"Kyn\u010dl, J., Valtr, P.: On edges crossing few other edges in simple topological complete graphs. Discret. Math. 309(7), 1917\u20131923 (2009). \nhttps:\/\/doi.org\/10.1016\/j.disc.2008.03.005","journal-title":"Discret. Math."},{"key":"2_CR50","doi-asserted-by":"crossref","unstructured":"Laso\u0144, M., Micek, P., Pawlik, A., Walczak, B.: Coloring intersection graphs of arcwise connected sets in the plane. In: Ne\u0161et\u0159il, J., Pellegrini, M. (eds.) Proceedings of 7th European Conference on Combinatorics, Graph Theory and Applications, pp. 299\u2013304. Scuola Normale Superiore, Pisa (2013)","DOI":"10.1007\/978-88-7642-475-5_48"},{"key":"2_CR51","unstructured":"Liu, C.H., Reddy, M.M., T\u00f3th, C.D.: Simple topological drawings of $$k$$-planar graphs. In: Book of Abstracts of the 36th European Workshop on Computational Geometry (EuroCG), pp. 80:1\u201380:6, W\u00fcrzburg (2020)"},{"issue":"4","key":"2_CR52","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/PL00007228","volume":"16","author":"S McGuinness","year":"2000","unstructured":"McGuinness, S.: Colouring arcwise connected sets in the plane I. Graphs Comb. 16(4), 429\u2013439 (2000). \nhttps:\/\/doi.org\/10.1007\/PL00007228","journal-title":"Graphs Comb."},{"issue":"2","key":"2_CR53","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00493-018-3733-1","volume":"39","author":"PO de Mendez","year":"2019","unstructured":"de Mendez, P.O., Oum, S., Wood, D.R.: Defective colouring of graphs excluding a subgraph or minor. Combinatorica 39(2), 377\u2013410 (2019). \nhttps:\/\/doi.org\/10.1007\/s00493-018-3733-1","journal-title":"Combinatorica"},{"issue":"3","key":"2_CR54","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00373-005-0616-1","volume":"21","author":"J Pach","year":"2005","unstructured":"Pach, J., Pinchasi, R., Sharir, M., T\u00f3th, G.: Topological graphs with no large grids. Graphs Comb. 21(3), 355\u2013364 (2005). \nhttps:\/\/doi.org\/10.1007\/s00373-005-0616-1","journal-title":"Graphs Comb."},{"issue":"6","key":"2_CR55","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.ejc.2003.09.019","volume":"25","author":"J Pach","year":"2004","unstructured":"Pach, J., Pinchasi, R., Tardos, G., T\u00f3th, G.: Geometric graphs with no self-intersecting path of length three. Eur. J. Comb. 25(6), 793\u2013811 (2004). \nhttps:\/\/doi.org\/10.1016\/j.ejc.2003.09.019","journal-title":"Eur. J. Comb."},{"key":"2_CR56","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1090\/conm\/342\/06141","volume-title":"Towards a Theory of Geometric Graphs, Contemporary Mathematics","author":"J Pach","year":"2004","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: A generalization of quasi-planarity. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs, Contemporary Mathematics, vol. 342, pp. 177\u2013183. AMS, Providence (2004)"},{"issue":"4","key":"2_CR57","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00454-006-1264-9","volume":"36","author":"J Pach","year":"2006","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discret. Comput. Geom. 36(4), 527\u2013552 (2006). \nhttps:\/\/doi.org\/10.1007\/s00454-006-1264-9","journal-title":"Discret. Comput. Geom."},{"key":"2_CR58","doi-asserted-by":"publisher","unstructured":"Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: Relaxing planarity for topological graphs. In: Gy\u0151ri, E., Katona, G.O.H., Lov\u00e1sz, L., Fleiner, T. (eds.) More Sets, Graphs and Numbers: A Salute to Vera S\u00f3s and Andr\u00e1s Hajnal, pp. 285\u2013300. Springer, Berlin (2006). \nhttps:\/\/doi.org\/10.1007\/978-3-540-32439-3_12","DOI":"10.1007\/978-3-540-32439-3_12"},{"issue":"1","key":"2_CR59","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02086610","volume":"16","author":"J Pach","year":"1996","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica 16(1), 111\u2013117 (1996). \nhttps:\/\/doi.org\/10.1007\/BF02086610","journal-title":"Algorithmica"},{"issue":"3","key":"2_CR60","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). \nhttps:\/\/doi.org\/10.1007\/BF01215922","journal-title":"Combinatorica"},{"key":"2_CR61","doi-asserted-by":"publisher","unstructured":"Pach, J., T\u00f3th, G.: A crossing lemma for multigraphs. Discret. Comput. Geom. 63, 918\u2013933 (2020) \nhttps:\/\/doi.org\/10.1007\/s00454-018-00052-z","DOI":"10.1007\/s00454-018-00052-z"},{"key":"2_CR62","unstructured":"Radermacher, M., Rutter, I.: Inserting an edge into a geometric embedding. In: Biedl, T., Kerren, A. (eds.) Proceedings of 26th Symposium on Graph Drawing and Network Visualization (GD). Springer, Cham (2018). \narxiv:1807.11711"},{"issue":"1","key":"2_CR63","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. Math. Semin. Univ. Hambg. 29(1), 107\u2013117 (1965). \nhttps:\/\/doi.org\/10.1007\/BF02996313","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"issue":"4","key":"2_CR64","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1007\/s00454-018-0031-z","volume":"61","author":"A Rok","year":"2019","unstructured":"Rok, A., Walczak, B.: Coloring curves that cross a fixed curve. Discret. Comput. Geom. 61(4), 830\u2013851 (2019). \nhttps:\/\/doi.org\/10.1007\/s00454-018-0031-z","journal-title":"Discret. Comput. Geom."},{"key":"2_CR65","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. DS21, 1\u2013113 (2017). \nhttp:\/\/www.combinatorics.org\/files\/Surveys\/ds21\/ds21v3-2017.pdf\n\n. Version\u00a03"},{"key":"2_CR66","series-title":"Discrete Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1201\/9781315152394","volume-title":"Crossing Numbers of Graphs","author":"M Schaefer","year":"2018","unstructured":"Schaefer, M.: Crossing Numbers of Graphs. Discrete Mathematics and Its Applications. CRC Press, Boca Raton (2018)"},{"key":"2_CR67","doi-asserted-by":"publisher","unstructured":"Schmidt, J.M.: Mondshein sequences (a.k.a. $$(2,1)$$-orders). SIAM J. Comput. 45(6), 1985\u20132003 (2016). \nhttps:\/\/doi.org\/10.1137\/15M1030030","DOI":"10.1137\/15M1030030"},{"key":"2_CR68","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.comgeo.2015.06.001","volume":"50","author":"A Suk","year":"2015","unstructured":"Suk, A., Walczak, B.: New bounds on the maximum number of edges in $$k$$-quasi-planar graphs. Comput. Geom. 50, 24\u201333 (2015). \nhttps:\/\/doi.org\/10.1016\/j.comgeo.2015.06.001","journal-title":"Comput. Geom."},{"issue":"3","key":"2_CR69","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"LA Sz\u00e9kely","year":"1997","unstructured":"Sz\u00e9kely, L.A.: Crossing numbers and hard Erd\u0151s problems in discrete geometry. Comb. Probab. Comput. 6(3), 353\u2013358 (1997). \nhttps:\/\/doi.org\/10.1017\/S0963548397002976","journal-title":"Comb. Probab. Comput."},{"key":"2_CR70","doi-asserted-by":"publisher","unstructured":"Tardos, G.: Construction of locally plane graphs with many edges. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 541\u2013562. Springer, New York (2013). \nhttps:\/\/doi.org\/10.1007\/978-1-4614-0110-0_29","DOI":"10.1007\/978-1-4614-0110-0_29"},{"issue":"3","key":"2_CR71","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1137\/050623693","volume":"21","author":"G Tardos","year":"2007","unstructured":"Tardos, G., T\u00f3th, G.: Crossing stars in topological graphs. SIAM J. Discret. Math. 21(3), 737\u2013749 (2007). \nhttps:\/\/doi.org\/10.1137\/050623693","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"2_CR72","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/jgt.3190120306","volume":"12","author":"C Thomassen","year":"1988","unstructured":"Thomassen, C.: Rectilinear drawings of graphs. J. Graph Theory 12(3), 335\u2013341 (1988). \nhttps:\/\/doi.org\/10.1002\/jgt.3190120306","journal-title":"J. Graph Theory"},{"key":"2_CR73","unstructured":"Valtr, P.: On the pair-crossing number. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry. MSRI Publications, vol. 52, pp. 545\u2013551. Cambridge University Press, Cambridge (2005)"},{"issue":"1","key":"2_CR74","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(98)00120-0","volume":"223","author":"S Wei-Kuan","year":"1999","unstructured":"Wei-Kuan, S., Wen-Lian, H.: A new planarity test. Theor. Comput. Sci. 223(1), 179\u2013191 (1999). \nhttps:\/\/doi.org\/10.1016\/S0304-3975(98)00120-0","journal-title":"Theor. Comput. Sci."},{"key":"2_CR75","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54(1), 150\u2013168 (1932). \nhttp:\/\/www.jstor.org\/stable\/2371086"}],"container-title":["Beyond Planar Graphs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-6533-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:26:10Z","timestamp":1601472370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-6533-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811565328","9789811565335"],"references-count":75,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-6533-5_2","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"}}]}}