Computer Science – Computational Geometry
Scientific paper
2007-09-26
Computer Science
Computational Geometry
23 pages, 16 figures. A much shorter version of this paper will appear at Graph Drawing 2008. This version incorporates feedba
Scientific paper
We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and such that no three points lie on the same axis-parallel line; we call a graph with such an embedding an xyz graph}. We describe a correspondence between xyz graphs and face-colored embeddings of the graph onto two-dimensional manifolds, and we relate bipartiteness of the xyz graph to orientability of the underlying topological surface. Using this correspondence, we show that planar graphs are xyz graphs if and only if they are bipartite, cubic, and three-connected, and that it is NP-complete to determine whether an arbitrary graph is an xyz graph. We also describe an algorithm with running time O(n 2^{n/2}) for testing whether a given graph is an xyz graph.
No associations
LandOfFree
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-694596