Abstract
We show that a planar graph and a tree can always be simultaneously embedded with fixed edges and that two outerplanar graphs generally cannot.
Work partially supported by EC - Fet Project DELIS - Contract no 001907, by “Project ALGO-NEXT: Algorithms for the Next Generation Internet and Web: Methodologies, Design, and Experiments”, and by MIUR Programmi di Ricerca Scientifica di Rilevante Interesse Nazionale.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Brass, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 243–255. Springer, Heidelberg (2003)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River (1999)
Di Giacomo, E., Liotta, G.: A note on simultaneous embedding of planar graphs (abstract). In: Proc. EWCG 2005, pp. 207–210 (2005)
Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 195–205. Springer, Heidelberg (2005)
Fáry, I.: On straight line representation of planar graphs. Ac. Sci. Math. Sz. 11, 229–233 (1948)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
Geyer, M., Kaufmann, M., Vrto, I.: Two trees which are self-intersecting when drawn simultaneously. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 201–210. Springer, Heidelberg (2006)
Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. North-Holland, Amsterdam (1988)
Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 263–274. Springer, Heidelberg (1999)
Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM Sympos. Discr. Alg., pp. 138–148. ACM Press, New York (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Frati, F. (2007). Embedding Graphs Simultaneously with Fixed Edges . In: Kaufmann, M., Wagner, D. (eds) Graph Drawing. GD 2006. Lecture Notes in Computer Science, vol 4372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70904-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-70904-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70903-9
Online ISBN: 978-3-540-70904-6
eBook Packages: Computer ScienceComputer Science (R0)