Generating maps on surfaces
From MaRDI portal
Abstract: We describe procedures for generating all 2-cell embedded simple graphs with up to a fixed number of vertices on a given surface. We also modify these procedures to generate closed 2-cell embeddings and polyhedral embeddings. We give results of computer implementations of these procedures for seven surfaces: the sphere, the torus, the double torus, the projective plane, the Klein bottle, the triple cross surface, and the quadruple cross surface.
Recommendations
Cites work
- All 2-manifolds have finitely many minimal triangulations
- Fast generation of planar graphs
- Generating the triangulations of the projective plane
- Graph minors. VII: Disjoint paths on a surface
- Graphs on surfaces
- scientific article; zbMATH DE number 4024313 (Why is no real title available?)
- scientific article; zbMATH DE number 3509333 (Why is no real title available?)
- Irreducible triangulations of the Klein bottle
- Isomorph-Free Exhaustive Generation
- Note on the irreducible triangulations of the Klein bottle
Cited in
(8)- Operations on oriented maps
- Generating projective plane polyhedral maps
- The construction of cubic maps on orientable surfaces
- Enumeration and random realization of triangulated surfaces
- The optimal packing of eight points in the real projective plane
- Space-efficient generation of nonisomorphic maps and hypermaps
- Generating maps on oriented surfaces using the homomorphism principle
- Computation of toroidal Schnyder woods made simple and fast: from theory to practice
This page was built for publication: Generating maps on surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517449)