On Z-monodromies in embedded graphs
Abstract
We characterize all permutations which realize as the z-monodromies of faces in connected simple finite graphs embedded in surfaces whose duals are also simple.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.