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

  • Hristo N. Djidjev
Conference paper

DOI: 10.1007/3-540-58950-3_358

Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)
Cite this paper as:
Djidjev H.N. (1995) On drawing a graph convexly in the plane (extended abstract). In: Tamassia R., Tollis I.G. (eds) Graph Drawing. GD 1994. Lecture Notes in Computer Science, vol 894. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Hristo N. Djidjev
    • 1
  1. 1.Department of Computer ScienceRice UniversityHostonUSA

Personalised recommendations