Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume


A Fary grid drawing of a graph is a drawing on a three-dimensional grid such that vertices are placed at integer coordinates and edges are straight-lines such that no edge crossings are allowed. In this paper it is proved that each k-colorable graph (k 2) needs at least (n 3=2) volume to be drawn. Furthermore, it is shown how to draw 2-, 3-and 4-colorable… (More)
DOI: 10.1007/3-540-62495-3_37


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics