In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely, we show how to make a 3D straight-line grid drawing of 4-colorable graphs in O(n(2)) volume. Moreover, we prove that each bipartite graph needs at least Omega(n(3/2)) volume. (C) 1997 Elsevier Science B.V.
3D straight-line grid drawing of 4-colorable graphs / Calamoneri, Tiziana; Sterbini, Andrea. - In: INFORMATION PROCESSING LETTERS. - ISSN 0020-0190. - STAMPA. - 63:2(1997), pp. 97-102. [10.1016/s0020-0190(97)00098-7]
3D straight-line grid drawing of 4-colorable graphs
CALAMONERI, Tiziana;STERBINI, Andrea
1997
Abstract
In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely, we show how to make a 3D straight-line grid drawing of 4-colorable graphs in O(n(2)) volume. Moreover, we prove that each bipartite graph needs at least Omega(n(3/2)) volume. (C) 1997 Elsevier Science B.V.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
