P. Bose, J. Czyzowicz, P. Morin, and D. R. Wood, The Maximum Number of Edges in a Three-Dimensional Grid-Drawing, Journal of Graph Algorithms and Applications, vol.8, issue.1, pp.21-26, 2004.
DOI : 10.7155/jgaa.00079

T. Calamoneri and A. Sterbini, 3D straight-line grid drawing of 4-colorable graphs, Information Processing Letters, vol.63, issue.2, pp.97-102, 1997.
DOI : 10.1016/S0020-0190(97)00098-7

R. F. Cohen, P. Eades, T. Lin, and F. Ruskey, Three-dimensional graph drawing, Algorithmica, pp.199-208, 1997.

V. Dujmovi´cdujmovi´c, P. Morin, and D. R. Wood, Layout of Graphs with Bounded Tree-Width, SIAM Journal on Computing, vol.34, issue.3, pp.553-579, 2005.
DOI : 10.1137/S0097539702416141

V. Dujmovi´cdujmovi´c and D. R. Wood, Three-dimensional grid drawings with subquadratic volume, GD '03), pp.190-201, 2004.

V. Dujmovi´cdujmovi´c and D. R. Wood, Stacks, Queues and Tracks: Layouts of Graph Subdivisions, pp.155-202, 2005.

B. Dyck, J. Joevenazzo, E. Nickle, J. Wilsdon, and S. Wismath, Drawing Kn in 3D with 2 Bends Per Edge, U. of Lethbridge Tech Rep, pp.2-7, 2004.

S. Felsner, G. Liotta, and S. Wismath, Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions, Journal of Graph Algorithms and Applications, vol.7, issue.4, pp.363-398, 2003.
DOI : 10.7155/jgaa.00075

M. Kaufmann and R. Wiese, Embedding Vertices at Points: Few Bends Suffice for Planar Graphs, Journal of Graph Algorithms and Applications, vol.6, issue.1, pp.115-129, 2002.
DOI : 10.7155/jgaa.00046
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.8940

P. Morin and D. R. Wood, Three-dimensional 1-bend graph drawings, JGAA, vol.8, issue.3, 2004.
DOI : 10.7155/jgaa.00095
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.2638

J. Pach, T. Thiele, and G. Tóth, Three-dimensional grid drawings of graphs, LNCS, vol.1353, pp.47-51, 1997.