Three-Dimensional Graph Drawing
Publisher
Springer New York
Reference21 articles.
1. Bose P, Czyzowicz J, Morin P, Wood DR (2004) The maximum number of edges in a three-dimensional grid-drawing. J Graph Algorithms Appl 8(1):21–26
2. Cohen RF, Eades P, Lin T, Ruskey F (1996) Three-dimensional graph drawing. Algorithmica 17(2):199–208
3. Devillers O, Everett H, Lazard S, Pentcheva M, Wismath S (2006) Drawing K n in three dimensions with one bend per edge. J Graph Algorithms Appl 10(2):287–295
4. Di Battista G, Frati F, Pách J (2013) On the queue number of planar graphs. SIAM J Comput 42(6):2243–2285
5. Di Giacomo E, Liotta G, Meijer H, Wismath SK (2009) Volume requirements of 3D upward drawings. Discret Math 309(7):1824–1837