Search arXivSearch

arXiv · 2509.14964

On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces

Abstract

Although the strong embedding of a 3-connected planar graph $G$ on the sphere is unique, $G$ can have different inequivalent strong embeddings on a surface of positive genus. If $G$ is cubic, then the strong embeddings of $G$ on the projective plane, the torus and the Klein bottle each are in one-to-one correspondence with certain subgraphs of the dual graph $G^\ast$. Here, we exploit this characterisation and show that two strong embeddings of $G$ on the projective plane, the torus or the Klein bottle are isomorphic if and only if the corresponding subgraphs of $G^{\ast}$ are contained in the same orbit under $\mathrm{Aut}(G^{\ast})$. This allows us to construct a data base containing all isomorphism classes of strong embeddings on the projective plane, the torus and the Klein bottle of all 3-connected cubic planar graphs with up to 22 vertices. Moreover, we establish that cyclically 4-edge connected cubic planar graphs can be strongly embedded on orientable surfaces of positive genera. We use this to show that a 3-connected cubic planar graph has no strong embedding on orientable surfaces of positive genera if and only if it is the dual of an Apollonian network.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Meike Weiß, Reymond Akpanya, Alice C. Niemeyer. 2025-09-18. On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces. https://arxiv.org/abs/2509.14964

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO