ThreeDimensional Grid Drawings of GraphsPach, János and Thiele, Torsten and Tóth, Géza (1998) ThreeDimensional Grid Drawings of Graphs. In: Graph Drawing 5th International Symposium, GD '97, September 1820, 1997 , pp. 4751(Official URL: http://dx.doi.org/10.1007/3540639381_49). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3540639381_49
AbstractA threedimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straightline segments representing the edges of G are pairwise noncrossing. It is shown that for any fixed r \geq 2, every rcolorable graph of n vertices has a threedimensional grid drawing that fits into a box of volume O(n^{2}). The order of magnitude of this bound cannot be improved.
Actions (login required)
