Bipartite graphs and their dessins d'enfants
classification
🧮 math.CO
keywords
dessinsenfantsbipartitefinitegroupalgorithmautomorphimscell
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.