1. Biedl, T.C.: Heuristics for 3D-orthogonal graph drawings. In: Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization, pp. 41–44 (1995)
2. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London (1976)
3. Lecture Notes in Computer Science;F. Brandenburg,2004
4. Closson, M., Gartshore, S., Johansen, J., Wismath, S.K.: Fully dynamic 3-dimensional orthogonal graph drawing. J. of Graph Algorithms and Applications 5(2), 1–34 (2001)
5. Demaine, E.D., Mitchell, J.S.B., O’Rourke, J. (eds.): The Open Problems Project,
http://cs.smith.edu/~orourke/TOPP/Welcome.html