@inbook{dc17f8e497be4078b5ca8559045071b7,
title = "On simultaneous planar graph embeddings",
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 in which the mapping is not given. In particular, given a mapping, we show how to embed two paths on an n x n grid, and two caterpillar graphs on a 3n x 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 graphs can be embedded simultaneously on an O(n) x O(n) grid, and an outerplanar and general planar graph can be embedded simultaneously on an O(n2) x O(n2) grid.",
author = "P. Brass and E. Cenek and Duncan, \{Christian A.\} and A. Efrat and C. Erten and D. Ismailescu and Kobourov, \{S. G.\} and A. Lubiw and Mitchell, \{J. S.B.\}",
year = "2003",
doi = "10.1007/978-3-540-45078-8\_22",
language = "English",
isbn = "3540405453",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "243--255",
editor = "Frank Dehne and Jorg-Rudiger Sack and Michiel Smid",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}