Graph Drawing

Volume 894 of the series Lecture Notes in Computer Science pp 76-83


On drawing a graph convexly in the plane (extended abstract)

  • Hristo N. DjidjevAffiliated withDepartment of Computer Science, Rice University


Let G be a planar graph and H be a subgraph of G. Given any convex drawing of H, we investigate the problem of how to extend the drawing of H to a convex drawing of G. We obtain a necessary and sufficient condition for the existence and a linear algorithm for the construction of such an extension. Our results and their corollaries generalize previous theoretical and algorithmic results of Tutte, Thomassen, Chiba, Yamanouchi, and Nishizeki.