Genus of Embedded Graphs in Orientable Closed Surfaces
Geometric Topology
2023-11-27 v1 Combinatorics
Abstract
We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph can be embedded. For this, we construct some special branched coverings of the 2-sphere. We apply this algorithm to calculate the orientable genus and maximal genus of some Snarks graphs.
Cite
@article{arxiv.2311.13741,
title = {Genus of Embedded Graphs in Orientable Closed Surfaces},
author = {Lorena Armas-Sanabria and Víctor Núñez},
journal= {arXiv preprint arXiv:2311.13741},
year = {2023}
}
Comments
10 pages, 3 figures