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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.