Skip to main content
SpringerLink
Log in
Book cover

Beyond Planar Graphs pp 1–9Cite as

Beyond Planar Graphs: Introduction

  • Chapter
  • First Online:

Abstract

Recent research topics in topological graph theory and graph drawing generalize the notion of planarity to sparse non-planar graphs called beyond planar graphs with forbidden crossing patterns. In this chapter, we introduce various types of beyond planar graphs and briefly review known results on the edge density, computational complexity, and algorithms for testing beyond planar graphs.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ackerman, E.: On the maximum number of edges in topological graphs with no four pairwise crossing edges. Discret. Comput. Geom. 41(3), 365–375 (2009). https://doi.org/10.1007/s00454-009-9143-9

  2. Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17(1), 1–9 (1997). https://doi.org/10.1007/BF01196127

  3. 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óth, C.D.: Simple k-planar graphs are simple (k839+82391)-quasiplanar. J. Comb. Theory, Ser. B 142, 1–35 (2020). https://doi.org/10.1016/j.jctb.2019.08.006

  4. Argyriou, E.N., Bekos, M.A., Symvonis, A.: The straight-line RAC drawing problem is np-hard. J. Graph Algorithms Appl. 16(2), 569–597 (2012). https://doi.org/10.7155/jgaa.00274

  5. Auer, C., Bachmaier, C., Brandenburg, F.J., Gleißner, A., Hanauer, K., Neuwirth, D., Reislhuber, J.: Outer 1-planar graphs. Algorithmica 74(4), 1293–1320 (2016). https://doi.org/10.1007/s00453-015-0002-1

  6. Auer, C., Brandenburg, F.J., Gleißner, A., Reislhuber, J.: 1-planarity of graphs with a rotation system. J. Graph Algorithms Appl. 19(1), 67–86 (2015). https://doi.org/10.7155/jgaa.00347

  7. Bae, S.W., Baffier, J., Chun, J., Eades, P., Eickmeyer, K., Grilli, L., Hong, S., Korman, M., Montecchiani, F., Rutter, I., Tóth, C.D.: Gap-planar graphs. Theor. Comput. Sci. 745, 36–52 (2018). https://doi.org/10.1016/j.tcs.2018.05.029

  8. Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. J. Graph Algorithms Appl. 22(1), 23–49 (2018). https://doi.org/10.7155/jgaa.00457

  9. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)

    Google Scholar 

  10. Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S., Kaufmann, M.: On the recognition of fan-planar and maximal outer-fan-planar graphs. Algorithmica 79(2), 401–427 (2017). https://doi.org/10.1007/s00453-016-0200-5

  11. Biedl, T.C., Liotta, G., Montecchiani, F.: Embedding-preserving rectangle visibility representations of nonplanar graphs. Discret. Comput. Geom. 60(2), 345–380 (2018). https://doi.org/10.1007/s00454-017-9939-y

  12. Binucci, C., Giacomo, E.D., Didimo, W., Montecchiani, F., Patrignani, M., Symvonis, A., Tollis, I.G.: Fan-planarity: properties and complexity. Theor. Comput. Sci. 589, 76–86 (2015). https://doi.org/10.1016/j.tcs.2015.04.020

  13. Borodin, O.V.: Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of \(1\)-planar graphs. Metody Diskret. Analiz. 41, 12–26, 108 (1984)

    Google Scholar 

  14. Brandenburg, F.J.: Recognizing optimal 1-planar graphs in linear time. Algorithmica 80(1), 1–28 (2018). https://doi.org/10.1007/s00453-016-0226-8

  15. Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803–1829 (2013). https://doi.org/10.1137/120872310

  16. Chaplick, S., Kryven, M., Liotta, G., Löffler, A., Wolff, A.: Beyond outerplanarity. In: F. Frati, K. Ma (eds.) Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers, Lecture Notes in Computer Science, vol. 10692, pp. 546–559. Springer (2017). https://doi.org/10.1007/978-3-319-73915-1_42

  17. Cheong, O., Har-Peled, S., Kim, H., Kim, H.: On the number of edges of fan-crossing free graphs. Algorithmica 73(4), 673–695 (2015). https://doi.org/10.1007/s00453-014-9935-z

  18. Dehkordi, H.R., Eades, P., Hong, S., Nguyen, Q.H.: Circular right-angle crossing drawings in linear time. Theor. Comput. Sci. 639, 26–41 (2016). https://doi.org/10.1016/j.tcs.2016.05.017

  19. Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39), 5156–5166 (2011). https://doi.org/10.1016/j.tcs.2011.05.025

  20. Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 4:1–4:37 (2019). https://doi.org/10.1145/3301281

  21. Eades, P., Hong, S., 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–76 (2013). https://doi.org/10.1016/j.tcs.2013.09.029

  22. Eades, P., Hong, S., Liotta, G., Katoh, N., Poon, S.: Straight-line drawability of a planar graph plus an edge. In: F. Dehne, J. Sack, U. Stege (eds.) Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, Lecture Notes in Computer Science, vol. 9214, pp. 301–313. Springer (2015). https://doi.org/10.1007/978-3-319-21840-3_25

  23. Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. Discret. Appl. Math. 161(7–8), 961–969 (2013). https://doi.org/10.1016/j.dam.2012.11.019

  24. Fabrici, I., Madaras, T.: The structure of 1-planar graphs. Discrete Mathematics 307(7–8), 854–865 (2007)

    Article  MathSciNet  Google Scholar 

  25. Fáry, I.: On straight line representations of planar graphs. Acta Sci. Math. Szeged 11, 229–233 (1948)

    MathSciNet  MATH  Google Scholar 

  26. Fox, J., Pach, J., Suk, A.: The number of edges in k-quasi-planar graphs. SIAM J. Discrete Math. 27(1), 550–561 (2013). https://doi.org/10.1137/110858586

  27. Giacomo, E.D., Didimo, W., Eades, P., Liotta, G.: 2-layer right angle crossing drawings. Algorithmica 68(4), 954–997 (2014). https://doi.org/10.1007/s00453-012-9706-7

  28. Giacomo, E.D., Eades, P., Liotta, G., Meijer, H., Montecchiani, F.: Polyline drawings with topological constraints. Theor. Comput. Sci. 809, 250–264 (2020). https://doi.org/10.1016/j.tcs.2019.12.016

  29. Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1–11 (2007). https://doi.org/10.1007/s00453-007-0010-x

  30. Hong, S., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear-time algorithm for testing outer-1-planarity. Algorithmica 72(4), 1033–1054 (2015). https://doi.org/10.1007/s00453-014-9890-8

  31. Hong, S., Nagamochi, H.: Re-embedding a 1-plane graph into a straight-line drawing in linear time. In: Y. Hu, M. Nöllenburg (eds.) Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, Lecture Notes in Computer Science, vol. 9801, pp. 321–334. Springer (2016). https://doi.org/10.1007/978-3-319-50106-2_25

  32. Hong, S., Nagamochi, H.: A linear-time algorithm for testing full outer-2-planarity. Discret. Appl. Math. 255, 234–257 (2019). https://doi.org/10.1016/j.dam.2018.08.018

  33. Hong, S.H., Eades, P., Liotta, G., Poon, S.H.: Fáry’s theorem for 1-planar graphs. In: J. Gudmundsson, J. Mestre, T. Viglas (eds.) Proceedings of COCOON 2012, Lecture Notes in Computer Science, vol. 7434, pp. 335–346. Springer (2012)

    Google Scholar 

  34. Hudák, D., Madaras, T., Suzuki, Y.: On properties of maximal 1-planar graphs. Discussiones Mathematicae Graph Theory 32(4), 737–747 (2012). https://doi.org/10.7151/dmgt.1639

  35. Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR (2014). http://arxiv.org/abs/1403.6184

  36. Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49–67 (2017). https://doi.org/10.1016/j.cosrev.2017.06.002

  37. Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theory 72(1), 30–71 (2013)

    Article  MathSciNet  Google Scholar 

  38. Nagamochi, H.: Straight-line drawability of embedded graph. Technical Report 2013–005, Department of Applied Mathematics and Physics, Kyoto University, Japan (2013)

    Google Scholar 

  39. Nishizeki, T., Rahman, M.S.: Planar Graph Drawing, Lecture Notes Series on Computing, vol. 12. World Scientific (2004). https://doi.org/10.1142/5648

  40. Pach, J., Tóth, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427–439 (1997)

    Article  MathSciNet  Google Scholar 

  41. Suzuki, Y.: Optimal 1-planar graphs which triangulate other surfaces. Discret. Math. 310(1), 6–11 (2010). https://doi.org/10.1016/j.disc.2009.07.016

  42. Thomassen, C.: Rectilinear drawings of graphs. J. Graph Theory 12(3), 335–341 (1988)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work is supported by ARC (Australian Research Council) Discovery Project grant.

Author information

Authors and Affiliations

  1. University of Sydney, Sydney, Australia

    Seok-Hee Hong

Authors
  1. Seok-Hee Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seok-Hee Hong .

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Sydney, Sydney, NSW, Australia

    Seok-Hee Hong

  2. School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo, Japan

    Takeshi Tokuyama

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Hong, SH. (2020). Beyond Planar Graphs: Introduction. In: Hong, SH., Tokuyama, T. (eds) Beyond Planar Graphs. Springer, Singapore. https://doi.org/10.1007/978-981-15-6533-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-6533-5_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-6532-8

  • Online ISBN: 978-981-15-6533-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation