2013 | OriginalPaper | Buchkapitel
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs
verfasst von : Patrizio Angelini, William Evans, Fabrizio Frati, Joachim Gudmundsson
Erschienen in: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We show that every
n
-vertex planar graph admits a simultaneous embedding with no mapping and with fixed edges with any (
n
/2)-vertex planar graph. In order to achieve this result, we prove that every
n
-vertex plane graph has an induced outerplane subgraph containing at least
n
/2 vertices. Also, we show that every
n
-vertex planar graph and every
n
-vertex planar partial 3-tree admit a simultaneous embedding with no mapping and with fixed edges.