SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs |
| |
| Authors: | Patrizio Angelini William Evans Fabrizio Frati Joachim Gudmundsson |
| |
| Institution: | 1. DIPARTIMENTO DI INGEGNERIA, ROMA TRE UNIVERSITY, ROME, ITALY;2. DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF BRITISH COLUMBIA, VANCOUVER, CANADA;3. SCHOOL OF INFORMATION TECHNOLOGIES, THE UNIVERSITY OF SYDNEY, SYDNEY, AUSTRALIA |
| |
| Abstract: | We show that every n‐vertex planar graph admits a simultaneous embedding without mapping and with fixed edges with any  ‐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  vertices. Also, we show that every n‐vertex planar graph and every n‐vertex planar partial 3‐tree admit a simultaneous embedding without mapping and with fixed edges. |
| |
| Keywords: | |
|
|
