Skip to main content
Conference ProceedingsOPEN ACCESS

On the relationship between map graphs and clique planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9411 548-550
DOI: 10.1007/978-3-319-27261-0_46
1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., & Rutter, I. (2015). On the relationship between map graphs and clique planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9411, pp. 548–550). Springer Verlag. https://doi.org/10.1007/978-3-319-27261-0_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free