Bipartite graphs and their dessins d'enfants
Abstract
Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, 2-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins d'enfants, together their automorphims group, monodromy group and duality type.
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.