International Symposium on Graph Drawing and Network Visualization

Graph Drawing and Network Visualization pp 548-550 | Cite as

On the Relationship Between Map Graphs and Clique Planar Graphs

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9411)

Abstract

A map graph is a contact graph of internally-disjoint regions of the plane, where the contact can be even a point. Namely, each vertex is represented by a simple connected region and two vertices are connected by an edge iff the corresponding regions touch.

References

  1. 1.
    Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Intersection-link representations of graphs. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 217–230. Springer, Heidelberg (2015)Google Scholar
  2. 2.
    Chen, Z., Grigni, M., Papadimitriou, C.H.: Map graphs. J. ACM 49(2), 127–138 (2002)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Tübingen UniversityTübingenGermany
  2. 2.Roma Tre UniversityRomeItaly
  3. 3.Karlsruhe Institute of TechnologyKarlsruheGermany

Personalised recommendations