Bipartite graphs and their dessins d'enfants
arXiv:1611.02901
Abstract
Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, -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.