Enumerating the orientable 2-cell imbeddings of complete bipartite graphs

DOI10.1002/(SICI)1097-0118(199902)30:2%3C77::AID-JGT2%3E3.0.CO;2-WMaRDI QIDQ4229262zbMATH OpenOpenAlexFDO

Authors Bruce P. Mull

Publication date 19 July 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199902)30:2%3C77::aid-jgt2%3E3.0.co;2-w

zbMATH Keywords

labelled imbeddingsorientable 2-cell imbeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Recommendations

• Congruence classes of orientable 2-cell embeddings of bouquets of circles and dipoles
• Regular orientable embeddings of complete bipartite graphs
• Enumerating 2-Cell Imbeddings of Connected Graphs
• On the number of maximum genus embeddings of almost all graphs
• Enumerating reflexible 2-cell embeddings of connected graphs
• Enumerating Unlabelled Embeddings of Digraphs
• Regular embeddings of \(K_{n,n}\) where \(n\) is an odd prime power
• Equivalence of edge bicolored graphs on surfaces
• Enumeration of unlabelled mating graphs
• On counting planar embeddings

Cited in

(6)

• Enumerating 2-Cell Imbeddings of Connected Graphs
• Genus distribution of \(P_3 \mathop\square P_n\)
• Automorphisms of maps with a given underlying graph and their application to enumeration
• Group action for enumerating maps on surfaces
• A remark on embedded bipartite graphs
• Enumerating reflexible 2-cell embeddings of connected graphs

This page was built for publication: Enumerating the orientable 2-cell imbeddings of complete bipartite graphs

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