Generating maps on oriented surfaces using the homomorphism principle
From MaRDI portal
Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85)
Cites work
- A constructive enumeration of fusenes and benzenoids
- A practical algorithm for the computation of the genus
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Fast generation of cubic graphs
- Fast generation of planar graphs
- Fast generation of regular graphs and construction of cages
- Generating maps on surfaces
- Graphs on surfaces
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 86103 (Why is no real title available?)
- Isomorph-Free Exhaustive Generation
- Minors in random regular graphs
- On the maximum number of cliques in a graph embedded in a surface
- Practical graph isomorphism. II.
- The construction of cubic maps on orientable surfaces
This page was built for publication: Generating maps on oriented surfaces using the homomorphism principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7290749)