Drawing Planar Bipartite Graphs With Small Area
Biedl, Therese and Brandenburg, Franz J. (2005) Drawing Planar Bipartite Graphs With Small Area. In: Canadian Conference on Computational Geometry, August 10-12, 2005, Windsor, Ontario, Canada , pp. 105-108 . (In Press)
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.
Repository Staff Only: item control page