Universal Point Sets for Planar Graph Drawings with Circular Arcs
Abstract
We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a plane drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc.
Fichier principal
Hal.pdf (332.51 Ko)
Télécharger le fichier
topological_book_embedding2.png (14.78 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...