Let N be a positive integer. For any positive integer L ≤ N and any positive divisor r of N, we enumerate the equivalence classes of dessins d’enfants with N edges, L faces and two vertices whose representatives have automorphism groups of order r. Further, for any non-negative integer h, we enumerate the equivalence classes of dessins with N edges, h faces of degree 2 with h ≤ N, and two vertices whose representatives have automorphism group of order r. Our arguments are essentially based upon a natural one-to-one correspondence between the equivalence classes of all dessins with N edges and the equivalence classes of all pairs of permutations whose entries generate a transitive subgroup of the symmetric group of degree N.

Mathematics Subject Classification. Primary 14H57; Secondary 05A15, 20B30.