A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On the Relationship Between Map Graphs and Clique Planar Graphs
[chapter]

2015
*
Lecture Notes in Computer Science
*

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. Map graphs are introduced in [2] to allow the representation of graphs containing large cliques in a readable way. A clique planar graph is a graph G = (V, E) that admits a representation where each vertex u ∈ V is represented by an

doi:10.1007/978-3-319-27261-0_46
fatcat:hkdn2tj63jemdj7kbaa6tv5w7y