, Volume 10, Issue 1, pp 41–51

How to draw a planar graph on a grid

  • H. De Fraysseix
  • J. Pach
  • R. Pollack

DOI: 10.1007/BF02122694

Cite this article as:
De Fraysseix, H., Pach, J. & Pollack, R. Combinatorica (1990) 10: 41. doi:10.1007/BF02122694


Answering a question of Rosenstiehl and Tarjan, we show that every plane graph withn vertices has a Fáry embedding (i.e., straight-line embedding) on the 2n−4 byn−2 grid and provide anO(n) space,O(n logn) time algorithm to effect this embedding. The grid size is asymptotically optimal and it had been previously unknown whether one can always find a polynomial sized grid to support such an embedding. On the other hand we show that any setF, which can support a Fáry embedding of every planar graph of sizen, has cardinality at leastn+(1−o(1))√n which settles a problem of Mohar.

AMS subject classification (1980)


Copyright information

© Akadémiai Kiadó 1990

Authors and Affiliations

  • H. De Fraysseix
    • 1
  • J. Pach
    • 2
    • 3
  • R. Pollack
    • 3
  1. 1.CNRSParisFrance
  2. 2.Mathematical Institute of the Hungarian Academy of SciencesHungary
  3. 3.Courant InstituteNYUNew YorkUSA