Embedding K3,3 and K5 on the Double Torus

03/02/2022
by   William L. Kocay, et al.
0

The Kuratowski graphs K_3,3 and K_5 characterize planarity. Counting distinct 2-cell embeddings of these two graphs on orientable surfaces was previously done by using Burnside's Lemma and their automorphism groups, without actually constructing the embeddings. We obtain all 2-cell embeddings of these graphs on the double torus, using a constructive approach. This shows that there is a unique non-orientable 2-cell embedding of K_3,3, 14 orientable and 17 non-orientable 2-cell embeddings of K_5 on the double torus, which explicitly confirms the enumerative results. As a consequence, several new polygonal representations of the double torus are presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/20/2023

Bounds on the genus for 2-cell embeddings of prefix-reversal graphs

In this paper, we provide bounds for the genus of the pancake graph ℙ_n,...
research
03/19/2023

Counting Circuit Double Covers

We study a counting version of Cycle Double Cover Conjecture. We discuss...
research
02/16/2021

Roman Domination of the Comet, Double Comet, and Comb Graphs

One of the well-known measurements of vulnerability in graph theory is d...
research
09/20/2019

Linear-Time Recognition of Double-Threshold Graphs

A graph G = (V,E) is a double-threshold graph if there exist a vertex-we...
research
03/08/2021

Random 2-cell embeddings of multistars

By using permutation representations of maps, one obtains a bijection be...
research
09/07/2022

Physical configurations of a cell doublet with line tension, a theoretical study

As a first approximation, early embryos may be modeled as foams whose sh...
research
01/21/2021

A Fast Optimal Double Row Legalization Algorithm

In Placement Legalization, it is often assumed that (almost) all standar...

Please sign up or login with your details

Forgot password? Click here to reset