Group action graphs and parallel architectures
SIAM Journal on Computing
The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
Information Processing Letters
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Optimal three-dimensional layout of interconnection networks
Theoretical Computer Science
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Two Algorithms for Three Dimensional Orthogonal Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
An Algorithm for Three-Dimensional Orthogonal Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Optimal three-dimensional orthogonal graph drawing in the general position model
Theoretical Computer Science
Complexity of finding non-planar rectilinear drawings of graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
How to draw a Tait-colorable graph
GD'10 Proceedings of the 18th international conference on Graph drawing
Planar drawings of higher-genus graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
On rectilinear drawing of graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Hardness of approximate compaction for nonplanar orthogonal graph drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Polygons Drawn from Permutations
Fundamenta Informaticae - Strategies for Tomography
| Hi-index | 0.01 |
We define an xyz graph to be a spatial embedding of a 3-regular graph such that the edges at each vertex are mutually perpendicular and no three points lie on an axis-parallel line. We describe an equivalence between xyz graphs and 3-face-colored polyhedral maps, under which bipartiteness of the graph is equivalent to orientability of the map. We show that planar graphs are xyz graphs if and only if they are bipartite, cubic, and three-connected. It is NP-complete to recognize xyz graphs, but we show how to do this in time O (n 2 n /2).