{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:39:56Z","timestamp":1766378396126,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"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_8","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:06:26Z","timestamp":1601471186000},"page":"131-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fan-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Grilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"key":"8_CR1","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)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Angelini, P., Bekos, M.A., Brandenburg, F.J., Da Lozzo, G., Di Battista, G., Didimo, W., Liotta, G., Montecchiani, F., Rutter, I.: On the relationship between k-planar and k-quasi-planar graphs. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG, LNCS, vol. 10520, pp. 59\u201374. Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-68705-6_5"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2018.03.005","volume":"723","author":"P Angelini","year":"2018","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: 1-fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723, 23\u201350 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR4","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Pfister, M., Ueckerdt, T.: Beyond-planarity: Tur\u00e1n-type results for non-planar bipartite graphs. In: Hsu, W.-L., Lee, D.-T., Liao, C.-S. (eds.) ISAAC, LIPIcs, vol. 123, pp. 28:1\u201328:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"1","key":"8_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190100102","volume":"10","author":"K Asano","year":"1986","unstructured":"Asano, K.: The crossing number of $$K_{1,3, n}$$ and $$K_{2,3, n}$$. J. Graph Theory 10(1), 1\u20138 (1986)","journal-title":"J. Graph Theory"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Auer, C., Brandenburg, F.-J., Glei\u00dfner, A., Hanauer, K.: On sparse maximal 2-planar graphs. In: Didimo, W., Patrignani, K. (eds.) Graph Drawing, LNCS, vol. 7704, pp. 555\u2013556. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-36763-2_50"},{"key":"8_CR7","unstructured":"Won Bae, S., 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. 745, 36\u201352 (2018)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S.-H., Kaufmann, M.: On the recognition of fan-planar and maximal outer-fan-planar graphs. Algorithmica 79(2), 401\u2013427 (2017)","DOI":"10.1007\/s00453-016-0200-5"},{"key":"8_CR9","unstructured":"Bekos, M.A.: Didimo, W., Liotta, G., Mehrabi, S., Montecchiani, F.: On RAC drawings of 1-planar graphs. Theor. Comput. Sci. 689, 48\u201357 (2017)"},{"key":"8_CR10","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: Aronov, B., Katz, M.J. (eds.) SoCG, LIPIcs, vol. 77, pp. 16:1\u201316:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.7155\/jgaa.00398","volume":"21","author":"C Binucci","year":"2017","unstructured":"Binucci, C., Chimani, M., Didimo, W., Gronemann, M., Klein, K., Kratochv\u00edl, J., Montecchiani, F., Tollis, I.G.: Algorithms and characterizations for 2-layer fan-planarity: From caterpillar to stegosaurus. J. Graph Algorithms Appl. 21(1), 81\u2013102 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR12","unstructured":"Binucci, C., Di Giacomo, E., Didimo, W., Montecchiani, F., Patrignani, M., Symvonis, A., Tollis, I.G.: Fan-planarity: Properties and complexity. Theor. Comput. Sci. 589, 76\u201386 (2015)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Brandenburg, F.J.: A first order logic definition of beyond-planar graphs. J. Graph Algorithms Appl. (2018)","DOI":"10.7155\/jgaa.00455"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Brandenburg, F.-J., 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.) Graph Drawing, LNCS, vol. 7704, pp. 327\u2013338. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-36763-2_29"},{"key":"8_CR15","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River (1999)"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebr. Discrete Methods 4(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"1","key":"8_CR17","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"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) Graph Drawing, LNCS, vol. 1984, pp. 77\u201390. Springer, Berlin (2000)","DOI":"10.1007\/3-540-44541-2_8"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"417","DOI":"10.7155\/jgaa.00232","volume":"15","author":"M Hasheminezhad","year":"2011","unstructured":"Hasheminezhad, M., McKay, B.D., Reeves, T.: Recursive generation of simple planar 5-regular graphs and pentangulations. J. Graph Algorithms Appl. 15(3), 417\u2013436 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR20","unstructured":"Hoffmann, M., T\u00f3th, C.D.: Two-planar graphs are quasiplanar. In: Larsen, K.G., Bodlaender, H.L., Raskin, J.-F. (eds.) MFCS, LIPIcs, vol. 83, pp. 47:1\u201347:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"5","key":"8_CR21","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D Holten","year":"2006","unstructured":"Holten, D.: Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. IEEE Trans. Vis. Comput. Graphics 12(5), 741\u2013748 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"8_CR22","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs (2014). \n              arXiv:1403.6184"},{"key":"8_CR23","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. Sem. Univ. Hamb. 29, 107\u2013117 (1965)","journal-title":"Abh. Math. Sem. Univ. Hamb."},{"key":"8_CR24","unstructured":"Telea, A., Ersoy, O.: Image-based edge bundles: simplified visualization of large graphs. Comput. Graph. Forum 29(3), 843\u2013852 (2010)"}],"container-title":["Beyond Planar Graphs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-6533-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T23:06:25Z","timestamp":1601507185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-6533-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811565328","9789811565335"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-6533-5_8","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"}}]}}