2007/09/30 by David Eppstein · 1 citation
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Block graph #Book embedding #Computational Geometry and Mesh Generation #Embedding #Graph #Graph embedding #Line graph #Outerplanar graph #Planar graph #Topological and Geometric Data Analysis #Topological graph theory #cs.CG #math.CO
paper · pdf · doi:10.7155/jgaa.00283
published as J. Graph Algorithms & Applications 17(1): 35-55, 2013 · 23 pages, 16 figures. A much shorter version of this paper will appear at Graph Drawing 2008. This version incorporates feedback from the GD reviewers and new material on covering maps
arxiv created 2008/08/22 · openalex publication_date 2013/01/01 · arxiv updated 2015/07/16 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
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 2n/2) for testing whether a given graph is an xyz graph.