On the Relationship Between Map Graphs and Clique Planar Graphs

Angelini, Patrizio and Da Lozzo, Giordano and Di Battista, Giuseppe and Frati, Fabrizio and Patrignani, Maurizio and Rutter, Ignaz (2015) On the Relationship Between Map Graphs and Clique Planar Graphs. In: Graph Drawing and Network Visualization, 23rd International Symposium, GD 2015, September 24-26, 2015, Los Angeles, CA, USA , pp. 548-550 (Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_46).

Full text not available from this repository.

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.

Item Type:Conference Poster
Classifications:G Algorithms and Complexity > G.560 Geometry
Z Theory > Z.500 Representations
ID Code:1520

Repository Staff Only: item control page

References

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)

Chen, Z., Grigni, M., Papadimitriou, C.H.: Map graphs. J. ACM 49(2), 127–138 (2002)