Counting hypermaps by Egorychev's method
From MaRDI portal
Publication:505005
DOI10.1007/s13324-015-0119-zzbMath1353.05065OpenAlexW2228430400MaRDI QIDQ505005
Roman Nedela, Alexander Mednykh
Publication date: 18 January 2017
Published in: Analysis and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13324-015-0119-z
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Enumeration of unrooted hypermaps of a given genus
- Hypercartes pointées sur le tore: Décompositions et dénombrements. (Rooted genus one hypermaps on the torus: Decompositions and enumerations)
- Hypermaps versus bipartite maps
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Enumeration of planar constellations
- Recent progress in enumeration of hypermaps
- Virasoro constraints and topological recursion for Grothendieck's dessin counting
- Decomposition and group theoretic characterization of pairs of inverse relations of the Riordan type
- Enumeration of unrooted maps of a given genus
- Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices
- A Census of Planar Maps
This page was built for publication: Counting hypermaps by Egorychev's method
