Enumerating 2-Cell Imbeddings of Connected Graphs
From MaRDI portal
Publication:3798675
DOI10.2307/2047573zbMath0653.05028OpenAlexW4231515636MaRDI QIDQ3798675
Bruce P. Mull, Robert G. Rieper, Arthur T. White
Publication date: 1988
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2047573
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
On the average genus of a graph ⋮ Enumeration of graph embeddings ⋮ Topological Graph Theory: A Personal Account ⋮ Stratified graphs for imbedding systems ⋮ Graph covering projections arising from finite vector spaces over finite fields ⋮ Regular graph coverings whose covering transformation groups have the isomorphism extension property ⋮ Distribution of branched \(\mathbb{D}_ p\)-coverings of surfaces ⋮ Distributions of regular branched prime-fold coverings of surfaces ⋮ An Introduction to Random Topological Graph Theory ⋮ Optimal packings of up to six equal circles on a triangular flat torus ⋮ Enumerating reflexible 2-cell embeddings of connected graphs ⋮ Group action for enumerating maps on surfaces ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ On the number of maximum genus embeddings of almost all graphs ⋮ Optimal packings of up to five equal circles on a square flat torus ⋮ Incongruent embeddings of a bouquet into surfaces ⋮ Genus distributions for bouquets of circles ⋮ Optimized algorithm to find all symmetry-distinct maps of a graph: Application to topology-driven molecular design ⋮ Random Cayley maps for groups generated by involutions ⋮ Automorphisms of maps with a given underlying graph and their application to enumeration
