## On Drawing a Graph Convexly in the Plane (Extended Abstract)
Djidjev, Hristo
(1995)
Full text not available from this repository. ## AbstractLet 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.
Repository Staff Only: item control page References |