Enumerating 2-Cell Imbeddings of Connected Graphs

DOI10.2307/2047573MaRDI QIDQ3798675zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

equivalent rotationsgraph imbeddingsmap automorphismtopological graph theorywheel graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Enumeration of graph embeddings
• Number of embeddings of wheel graphs on surfaces of small genus.
• Enumerating the orientable 2-cell imbeddings of complete bipartite graphs
• Genus polynomials of cycles with double edges
• Congruence classes of orientable 2-cell embeddings of bouquets of circles and dipoles

Cited in

(25)

• Optimized algorithm to find all symmetry-distinct maps of a graph: Application to topology-driven molecular design
• A common cover of graphs and 2-cell embeddings
• Representations of graphs and networks (coding, layouts and embeddings)
• On the number of maximum genus embeddings of almost all graphs
• Genus distributions for bouquets of circles
• Random Cayley maps for groups generated by involutions
• Enumeration of graph embeddings
• Distribution of branched \(\mathbb{D}_ p\)-coverings of surfaces
• Group action for enumerating maps on surfaces
• 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
• Distributions of regular branched prime-fold coverings of surfaces
• Enumerating reflexible 2-cell embeddings of connected graphs
• On the average genus of a graph
• Automorphisms of maps with a given underlying graph and their application to enumeration
• Hierarchy for imbedding-distribution invariants of a graph
• Enumerating the orientable 2-cell imbeddings of complete bipartite graphs
• An Introduction to Random Topological Graph Theory
• Optimal packings of up to six equal circles on a triangular flat torus
• Incongruent embeddings of a bouquet into surfaces
• Random 2-cell embeddings of multistars
• Topological Graph Theory: A Personal Account
• Embeddings of K ₅ in the Torus
• Optimal packings of up to five equal circles on a square flat torus

This page was built for publication: Enumerating 2-Cell Imbeddings of Connected Graphs

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