Journal of Graph Algorithms and Applications
|Home||Issues||Aims and Scope||Instructions for Authors|
Universal Point Sets for Drawing Planar Graphs with Circular Arcs
Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, and Alexander Wolff
Vol. 18, no. 3, pp. 313-324, 2014. Regular paper.
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 planar 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.
Submitted: October 2013.
Reviewed: February 2014.
Revised: March 2014.
Accepted: April 2014.
Final: May 2014.
Published: May 2014.
Communicated by Csaba D. Tóth