Space-efficient generation of nonisomorphic maps and hypermaps

zbMATH Open1327.05158MaRDI QIDQ5502191FDOQ5502191

Authors: Timothy R. S. Walsh 

Publication date: 18 August 2015

Full work available at URL: http://www.emis.de/journals/JIS/VOL18/Walsh/walsh3.html

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Implements of some new algorithms for combinatorial maps
• Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices
• scientific article; zbMATH DE number 975323
• Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices
• Generating maps on surfaces

zbMATH Keywords

exhaustive generationhypermapmap

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Hypergraphs (05C65)

Cited In (7)

• Enumeration of \(r\)-regular maps on the torus. II: Unsensed maps
• Classifying (almost)-Belyi maps with five exceptional points
• The Harer-Zagier and Jackson formulas and new results for one-face bipartite maps
• Enumeration of hypermaps of a given genus
• Enumeration of unsensed orientable and non-orientable maps
• Implements of some new algorithms for combinatorial maps
• Enumeration of unsensed orientable and non-orientable maps

Uses Software

• OEIS

This page was built for publication: Space-efficient generation of nonisomorphic maps and hypermaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502191)