On the degree sequences of dual graphs on surfaces

08/02/2020
by   Endre Boros, et al.
0

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 d=(d_1,…,d_n) and t=(t_1,…,t_m) be their degree sequences. Then, clearly, ∑_i=1^n d_i = ∑_j=1^m t_j = 2ℓ, where ℓ is the number of edges in each of the two graphs, and χ = n - ℓ + m is the Euler characteristic of the surface. Which sequences d and 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 χ≤ 0.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/10/2019

An asymptotic combinatorial construction of 2D-sphere

A geometric space is constructed as the inverse limit of infinite sequen...
research
06/15/2018

A note on choosability with defect 1 of graphs on surfaces

This note proves that every graph of Euler genus μ is 2 + √(3μ + 3) --c...
research
10/03/2020

Planar projections of graphs

We introduce and study a new graph representation where vertices are emb...
research
02/01/2021

On the dichromatic number of surfaces

In this paper, we give bounds on the dichromatic number χ⃗(Σ) of a surfa...
research
04/15/2018

Regular Polygon Surfaces

A regular polygon surface M is a surface graph (Σ, Γ) together with a co...
research
05/04/2023

Homomorphisms between graphs embedded on surfaces

We extend the notion of graph homomorphism to cellularly embedded graphs...
research
12/22/2020

Towards a short proof of the Fulek–Kynčl criterion for modulo 2 embeddability of graphs to surfaces

A connected graph K has a modulo 2 embedding to the sphere with g handle...

Please sign up or login with your details

Forgot password? Click here to reset