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

DOI10.1007/s10958-017-3550-xzbMath1377.05087OpenAlexW2757086426MaRDI 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 formulanumber of unrooted hypermaps

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Riemann surfaces (30F99)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the enumeration of circular maps with given number of edges
• Enumeration of unrooted hypermaps of a given genus
• Hypermaps versus bipartite maps
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• Enumerative formulae for unrooted planar maps: a pattern
• Enumeration of Eulerian and unicursal planar maps
• A Census of Planar Maps
• Subgroups of Finite Index in Free Groups

This page was built for publication: On the enumeration of hypermaps which are self-equivalent with respect to reversing the colors of vertices