Abstract. We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another where the mapping is not given. In particular, we show that without mapping, any number of outerplanar graphs can be embedded simultaneously on an O(n) × O(n) grid, and an outerplanar and general planar graph can be embedded simultaneously on an O(n 2 ) × O(n 3 ) grid. If the mapping is given, we show how to embed two paths on an n × n grid, or two caterpillar graphs on an O(n 2 ) × O(n 3 ) grid.
The problem of simultaneous embedding of planar graphs was introduced in REF , where it is shown that pairs of paths, cycles, and caterpillars can always be realized, while for general planar graphs and even outerplanar graphs this is not always possible.
On Simultaneous Graph Embedding
ArXiv
ArXiv
Mathematics Computer Science