Embeddings of 3-connected 3-regular planar graphs on surfaces of non-negative Euler characteristic

Whitney's theorem states that every 3-connected planar graph is uniquely embeddable on the sphere. On the other hand, it has many inequivalent embeddings on another surface. We shall characterize structures of a $3$-connected $3$-regular planar graph $G$ embedded on the projective-plane, the torus and the Klein bottle, and give a one-to-one correspondence between inequivalent embeddings of $G$ on each surface and some subgraphs of the dual of $G$ embedded on the sphere. These results enable us to give explicit bounds for the number of inequivalent embeddings of $G$ on each surface, and propose effective algorithms for enumerating and counting these embeddings.Comment: 19 pages, 12 figure

On the genera of polyhedral embeddings of cubic graph

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given cubic graph and constructions for cubic graphs with some special properties of their polyhedral embeddings. Some key results are that even cubic graphs with a polyhedral embedding on the torus can also have polyhedral embeddings in arbitrarily high genus, in fact in a genus {\em close} to the theoretical maximum for that number of vertices, and that there is no bound on the number of genera in which a cubic graph can have a polyhedral embedding. While these results suggest a large variety of polyhedral embeddings, computations for up to 28 vertices suggest that by far most of the cubic graphs do not have a polyhedral embedding in any genus and that the ratio of these graphs is increasing with the number of vertices.Comment: The C-program implementing the algorithm described in this article can be obtained from any of the author

Flexibility Of Polyhedral Embeddings Of Graphs In Surfaces

Whitney’s theorem states that 3-connected planar graphs admit essentially unique embeddings in the plane. We generalize this result to embeddings of graphs in arbitrary surfaces by showing that there is a function ξ: N0 → N0 such that every 3-connected graph admits at most ξ(g) combinatorially distinct embeddings of face-width ≥ 3 into surfaces whose Euler genus is at most g

Flexibility Of Polyhedral Embeddings Of Graphs In Surfaces

Whitney's theorem states that 3-connected planar graphs admit essentially unique embeddings in the plane. We generalize this result to embeddings of graphs in arbitrary surfaces by showing that there is a function : N 0 ! N 0 such that every 3-connected graph admits at most (g) combinatorially distinct embeddings of face-width 3 into surfaces whose Euler genus is at most g