Skip to main content
Conference ProceedingsOPEN ACCESS

Embedding graphs simultaneously with fixed edges

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4372 LNCS 108-113
DOI: 10.1007/978-3-540-70904-6_12
32Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Frati, F. (2007). Embedding graphs simultaneously with fixed edges. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4372 LNCS, pp. 108–113). Springer Verlag. https://doi.org/10.1007/978-3-540-70904-6_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free