Enumerating the orientable 2-cell imbeddings of complete bipartite graphs
From MaRDI portal
Publication:4229262
DOI<77::AID-JGT2>3.0.CO;2-W 10.1002/(SICI)1097-0118(199902)30:2<77::AID-JGT2>3.0.CO;2-WzbMath0916.05036OpenAlexW4243325114MaRDI QIDQ4229262
Publication date: 19 July 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199902)30:2<77::aid-jgt2>3.0.co;2-w
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (4)
Enumerating reflexible 2-cell embeddings of connected graphs ⋮ Genus distribution of \(P_3 \mathop\square P_n\) ⋮ Group action for enumerating maps on surfaces ⋮ Automorphisms of maps with a given underlying graph and their application to enumeration
Cites Work
This page was built for publication: Enumerating the orientable 2-cell imbeddings of complete bipartite graphs
