On the degree sequences of dual graphs on surfaces
Combinatorics
2020-08-04 v1 Discrete Mathematics
Abstract
Given two graphs and with a one-to-one correspondence between their edges, when do and 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 and be their degree sequences. Then, clearly, , where is the number of edges in each of the two graphs, and is the Euler characteristic of the surface. Which sequences and 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, , and projective plane, . We conjecture that there exist no exceptions for .
Keywords
Cite
@article{arxiv.2008.00573,
title = {On the degree sequences of dual graphs on surfaces},
author = {Endre Boros and Vladimir Gurvich and Martin Milanič and Jernej Vičič},
journal= {arXiv preprint arXiv:2008.00573},
year = {2020}
}