Colorability in Orthogonal Graph DrawingStola, Jan (2008) Colorability in Orthogonal Graph Drawing. In: Graph Drawing 15th International Symposium, GD 2007, September 2426, 2007 , pp. 327338(Official URL: http://dx.doi.org/10.1007/9783540775379_32). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783540775379_32
AbstractThis paper studies the question: What is the maximum integer k_b,n such that every k_b,ncolorable graph has a bbend ndimensional orthogonal box drawing? We give an exact answer for the orthogonal line drawing in all dimensions and for the 3dimensional rectangle visibility representation. We present an upper and lower bound for the 3dimensional orthogonal drawing by rectangles and general boxes. Particularly, we improve the best known upper bound for the 3dimensional orthogonal box drawing from 183 to 42 and the lower bound from 3 to 22.
Actions (login required)
