Abstract
We characterize 4-map graphs as kite-augmented 1-planar graphs and show that they can be recognized in cubic time. For the description we use 1-planar graphs rather than maps and provide a recognition algorithm that is simpler and easier to analyze than the ones by Chen et al. (in: Proceedings of 30th annual ACM symposium on the theory of computing, STOC ’98, pp. 514–523, 1998; Algorithmica 45(2):227–262, 2006).
Similar content being viewed by others
References
Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: Straight-line drawings of 3-connected 1-planar graphs. In: Wismath, S., Wolff, A. (eds.) Proceedings of 21st International Symposium on Graph Drawing, GD 2013. LNCS, vol. 8242, pp. 83–94. Springer (2013)
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)
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)
Bachmaier, C., Brandenburg, F.J., Hanauer, K., Neuwirth, D., Reislhuber, J.: NIC-planar graphs. Discrete Appl. Math. 232, 23–40 (2017)
Biedl, T.C., Liotta, G., Montecchiani, F.: On visibility representations of non-planar graphs. In: Fekete, S.P., Lubiw, A. (eds.) Proceedings of 32nd International Symposium on Computational Geometry, SoCG 2016. LIPIcs, vol. 51, pp. 19:1–19:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)
Bodendiek, R., Schumacher, H., Wagner, K.: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel. Abh. aus dem Math. Seminar der Univ. Hamburg 53, 41–52 (1983)
Bodendiek, R., Schumacher, H., Wagner, K.: Über 1-optimale Graphen. Mathematische Nachrichten 117, 323–339 (1984)
Brandenburg, F.J.: Recognizing IC-planar and NIC-planar graphs. JGAA 22(2), 239–271 (2018)
Brandenburg, F.J.: Recognizing optimal 1-planar graphs in linear time. Algorithmica 80(1), 1–28 (2018)
Brandenburg, F.J., Eppstein, D., Gleißner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the density of maximal 1-planar graphs. In: van Kreveld, M., Speckmann, B. (eds.) Proceedings of 20th International Symposium on Graph Drawing, GD 2012. LNCS, vol. 7704, pp. 327–338. Springer (2013)
Chen, Z., Grigni, M., Papadimitriou, C.H.: Planar map graphs. In: Proceedings of 30th Annual ACM Symposium on the Theory of Computing, STOC ’98, pp. 514–523 (1998)
Chen, Z., Grigni, M., Papadimitriou, C.H.: Planar map graphs. Technical Report, Emory University (1999)
Chen, Z., Grigni, M., Papadimitriou, C.H.: Map graphs. J. ACM 49(2), 127–138 (2002)
Chen, Z., Grigni, M., Papadimitriou, C.H.: Recognizing hole-free 4-map graphs in cubic time. Algorithmica 45(2), 227–262 (2006)
Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210–223 (1985)
Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302–318 (1996)
Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956–997 (1996)
Diestel, R.: Graph Theory. Springer, Berlin (2000)
Fabrici, I., Madaras, T.: The structure of 1-planar graphs. Discrete Math. 307(7–8), 854–865 (2007)
Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1–11 (2007)
Harborth, H., Mengersen, I.: Drawings of the complete graph with maximum number of crossings. Congressus Numerantium 88, 225–228 (1992)
Henzinger, M.R., Rao, S., Gabow, H.N.: Computing vertex connectivity: new bounds from old techniques. J. Algorithms 34(2), 222–250 (2000)
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)
Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135–158 (1973)
Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49–67 (2017)
Kynčl, J.: Enumeration of simple complete topological graphs. Eur. J. Comb. 30(7), 1676–1685 (2009)
Mnich, M., Rutter, I., Schmidt, J.M.: Linear-time recognition of map graphs with outerplanar witness. Discrete Optim. 28, 63–77 (2018)
Ringel, G.: Ein Sechsfarbenproblem auf der Kugel. Abh. aus dem Math. Seminar der Univ. Hamburg 29, 107–117 (1965)
Schumacher, H.: Zur Struktur 1-planarer Graphen. Mathematische Nachrichten 125, 291–300 (1986)
Suzuki, Y.: Re-embeddings of maximum 1-planar graphs. SIAM J. Discrete Math. 24(4), 1527–1540 (2010)
Tamassia, R. (ed.): Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (2013)
Thomassen, C.: Rectilinear drawings of graphs. J. Graph Theor. 12(3), 335–341 (1988)
Thorup, M.: Map graphs in polynomial time. In: Proceedings of 39th Annual Symposium on Foundations of Computer Science, FOCS ’98. pp. 396–405 (1998)
Acknowledgements
I would like to thank Christian Bachmaier for many useful hints and the reviewers for their careful reading and their valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Brandenburg, F.J. Characterizing and Recognizing 4-Map Graphs. Algorithmica 81, 1818–1843 (2019). https://doi.org/10.1007/s00453-018-0510-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-018-0510-x