Drawing Planar Bipartite Graphs With Small Area
Thérèse Biedl, Franz–Josef Brandenburg · gdea - Graph Drawing E-print Archive (GDEA) · 2005
In this paper, we study planar straight-line drawings of bipartite planar graphs. We show that these graphs admit drawings in an n/2 x (n/2-1) -grid, and that this is optimal. Our results generalize to triangle-free planar graphs.