@inproceedings{a8cf8e5edc614597b12df6f8974be971,
title = "Colored simultaneous geometric embeddings",
abstract = "We introduce the concept of concept simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored with two or three colors. We use these results to show that colored simultaneous geometric embeddings exist for: (1) a 2-colored tree together with any number of 2-colored paths and (2) a 2-colored outerplanar graph together with any number of 2-colored paths. We also show that there does not exist a universal pointset of size n for paths colored with five colors. We finally show that the following simultaneous embeddings are not possible: (1) three 6-colored cycles, (2) four 6-colored paths, and (3) three 9-colored paths.",
author = "U. Brandes and C. Erten and J. Fowler and F. Frati and M. Geyer and C. Gutwenger and S. Hong and M. Kaufmann and Kobourov, \{S. G.\} and G. Liotta and P. Mutzel and A. Symvonis",
year = "2007",
doi = "10.1007/978-3-540-73545-8\_26",
language = "English (US)",
isbn = "9783540735441",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "254--263",
booktitle = "Computing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings",
note = "13th Annual International Computing and Combinatorics Conference, COCOON 2007 ; Conference date: 16-07-2007 Through 19-07-2007",
}