On Simultaneous Planar Graph Embeddings [chapter]

P. Brass, E. Cenek, C. A. Duncan, A. Efrat, C. Erten, D. Ismailescu, S. G. Kobourov, A. Lubiw, J. S. B. Mitchell
2003 Lecture Notes in Computer Science  
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 in which the mapping is not given. In particular, given a mapping, we show how to embed two paths on an n × n grid, and two caterpillar graphs on a 3n × 3n grid. We show that it is not always possible to simultaneously embed three paths. If the mapping is not given, we show that any number of outerplanar
more » ... raphs 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 2 ) grid.
doi:10.1007/978-3-540-45078-8_22 fatcat:6sbtuz47offrtda4venwyieb3a