Abstract : This paper shows that any planar graph with $n$ vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.
Contributor : Sylvain Lazard <>
Submitted on : Friday, November 13, 2009 - 9:41:24 AM
Last modification on : Wednesday, October 7, 2015 - 1:09:03 AM
Document(s) archivé(s) le : Thursday, June 17, 2010 - 8:16:05 PM