Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices
From MaRDI portal
Publication:442387
DOI10.1016/J.DISC.2011.11.027zbMATH Open1246.05076OpenAlexW2166525679MaRDI QIDQ442387FDOQ442387
Authors: Timothy R. S. Walsh, Alain Giorgetti, Alexander Mednykh
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.027
Recommendations
- Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices
- Enumeration of unrooted maps of a given genus
- Enumeration of genus-four maps by number of edges
- Counting rooted maps on an orientable surface of any genus by a function of the numbers of vertices and faces
- scientific article; zbMATH DE number 975323
Cites Work
- A Census of Planar Maps
- Title not available (Why is that?)
- Theory of Maps on Orientable Surfaces
- CYCLIC GROUPS OF AUTOMORPHISMS OF A COMPACT RIEMANN SURFACE
- The number of rooted maps on an orientable surface
- Counting rooted maps on an orientable surface of any genus by a function of the numbers of vertices and faces
- Enumeration of unrooted maps of a given genus
- Counting rooted maps by genus. I
- A Multivariate Arithmetic Function of Combinatorial and Topological Significance
- Automorphism groups of compact bordered Klein surfaces. A combinatorial approach
- On the enumeration of planar maps
- Title not available (Why is that?)
- Relations fonctionnelles et dénombrement des cartes pointées sur le tore. (Functional relations and the enumeration of rooted genus one maps)
- Title not available (Why is that?)
- Une relation fonctionnelle nouvelle sur les cartes planaires pointées
- The asymptotic number of rooted maps on a surface
- Counting unrooted planar maps
- Counting non-isomorphic chord diagrams
- Efficient enumeration of sensed planar maps
- A reductive technique for enumerating non-isomorphic planar maps
- Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices
- Enumeration of genus-four maps by number of edges
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating Nonisomorphic Maps without Storing Them
- Title not available (Why is that?)
- On the Tumber of Planar Maps
Cited In (19)
- Enumeration of maps regardless of genus: geometric approach
- Title not available (Why is that?)
- Recent progress in enumeration of hypermaps
- Relations fonctionnelles et dénombrement des cartes pointées sur le tore. (Functional relations and the enumeration of rooted genus one maps)
- Counting 2-connected 4-regular maps on the projective plane
- Enumeration of regular maps on surfaces of a given genus
- Space-efficient generation of nonisomorphic maps and hypermaps
- 4-edge-connected 4-regular maps on the projective plane
- Counting unrooted maps using tree-decomposition
- Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices
- The semi-arc automorphism group of a graph with application to map enumeration
- Counting maps on doughnuts
- Enumeration of hypermaps of a given genus
- Enumeration of unsensed orientable and non-orientable maps
- Non-recursive counts of graphs on surfaces
- Counting rooted maps on an orientable surface of any genus by a function of the numbers of vertices and faces
- Simple recurrence formulas to count maps on orientable surfaces
- Enumeration of unrooted maps of a given genus
- Enumeration of unsensed orientable and non-orientable maps
Uses Software
This page was built for publication: Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442387)