On the enumeration of hypermaps which are self-equivalent with respect to reversing the colors of vertices

DOI10.1007/s10958-017-3550-xzbMath1377.05087MaRDI QIDQ1687944

Peng Zhang

Publication date: 4 January 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-017-3550-x

zbMATH Keywords

enumeration formula; number of unrooted hypermaps

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05C30: Enumeration in graph theory

05C15: Coloring of graphs and hypergraphs

30F99: Riemann surfaces

Uses Software

• OEIS