Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.06768

2-cell embeddings of cubic graphs I. The unstable dual

MacKenzie Carr·Bojan Mohar
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, the first of a two-part series, we explore 2-cell embeddings of cubic graphs, particularly those with small genus. Using local rotations, we introduce a new way of describing the space of 2-cell embeddings and their mutual relationship for any fixed (cubic) graph. We introduce the unstable dual of an embedding of a cubic graph, a subgraph of the dual graph, and describe how the genus of the corresponding embedding can be recovered from properties of the unstable dual. Finally, we characterize the unstable duals of embeddings with genus at most 2 of cubic cyclically 5-edge connected planar graphs and use these to generate those of genus 3 that have connectivity at most 2.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

MacKenzie Carr, Bojan Mohar. 2026-06-04. 2-cell embeddings of cubic graphs I. The unstable dual. https://arxiv.org/abs/2606.06768

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗