Preprint · arXiv · August 2, 2020

On the degree sequences of dual graphs on surfaces

Endre Boros, Vladimir A. Gurvich, Martin Milanič, Jernej Vičič

Read on arXiv PDFDOI 10.48550/arxiv.2008.00573

Abstract

Given two graphs $G$ and $G^*$ with a one-to-one correspondence between their edges, when do $G$ and $G^*$ form a pair of dual graphs realizing the vertices and countries of a map embedded in a surface? A criterion was obtained by Jack Edmonds in 1965. Furthermore, let $\boldsymbol{d}=(d_1,\ldots,d_n)$ and $\boldsymbol{t}=(t_1,\ldots,t_m)$ be their degree sequences. Then, clearly, $\sum_{i=1}^n d_i = \sum_{j=1}^m t_j = 2\ell$, where $\ell$ is the number of edges in each of the two graphs, and $χ= n - \ell + m$ is the Euler characteristic of the surface. Which sequences $\boldsymbol{d}$ and $\boldsymbol{t}$ satisfying these conditions still cannot be realized as the degree sequences? We make use of Edmonds' criterion to obtain several infinite series of exceptions for the sphere, $χ= 2$, and projective plane, $χ= 1$. We conjecture that there exist no exceptions for $χ\leq 0$.

Advanced Graph Theory ResearchAdvanced Combinatorial MathematicsGraph theory and applicationsdegree sequencesdual graphgraph duality

On the degree sequences of dual graphs on surfaces

Abstract

More by Jernej Vičič