Sciweavers

Share
GD
2007
Springer

Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices

10 years 7 months ago
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
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.
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where GD
Authors Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath
Comments (0)
books