arXiv · 2311.13741
Genus of Embedded Graphs in Orientable Closed Surfaces
Abstract
We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph $G$ 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Lorena Armas-Sanabria, Víctor Núñez. 2023-11-23. Genus of Embedded Graphs in Orientable Closed Surfaces. https://arxiv.org/abs/2311.13741
Cite the original work for its findings. Save a collection to share your selection of sources.