Regular embeddings of complete bipartite graphs: classification and enumeration
By Gareth Aneurin Jones. 2009
67 citations recorded by the source corpus.
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in the cases where n is a prime power, obtained in collaboration with Du, Kwak, Nedela and Škoviera, together with results of Itô, Hall, Huppert and Wielandt on factorisable groups and on finite solvable groups.
Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/8c259ff6dacc7c95c5ad02144bc6e239376d720c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
In Geometry and Topology
Citations in the corpus
- Regular Cayley maps for cyclic groups (2014, background): “Regular maps are now viewed from three main perspectives: by the genus of the carrier surface (see [3,4]), by the underlying graph of the map (see [2,15,16]) or by the automorphism group (see [9]).”