Regular embeddings of canonical double coverings of graphs
Journal of Combinatorial Theory Series B
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Regular maps from voltage assignments and exponent groups
European Journal of Combinatorics
Determination of all regular maps of small genus
Journal of Combinatorial Theory Series B
Regular embeddings of complete multipartite graphs
European Journal of Combinatorics - Special issue: Topological graph theory II
Regular embeddings of Kn,n where n is a power of 2. I: Metacyclic case
European Journal of Combinatorics
Regular embeddings of Kn,n where n is an odd prime power
European Journal of Combinatorics
Complete bipartite graphs with a unique regular embedding
Journal of Combinatorial Theory Series B
New regular embeddings of n-cubes Qn
Journal of Graph Theory
Regular orientable embeddings of complete bipartite graphs
Journal of Graph Theory
Regular maps and hypermaps of Euler characteristic -1 to -200
Journal of Combinatorial Theory Series B
Regular embeddings of Kn,n where n is a power of 2. II: The non-metacyclic case
European Journal of Combinatorics
Classification of nonorientable regular embeddings of complete bipartite graphs
Journal of Combinatorial Theory Series B
Characterisations and Galois conjugacy of generalised Paley maps
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
An orientably-regular map is a 2-cell embedding of a connected graph or multigraph into an orientable surface, such that the group of all orientation-preserving automorphisms of the embedding has a single orbit on the set of all arcs (incident vertex-edge pairs). Such embeddings of the n-dimensional cubes Q n were classified for all odd n by Du, Kwak and Nedela in 2005, and in 2007, Jing Xu proved that for n=2m where m is odd, they are precisely the embeddings constructed by Kwon in 2004. Here, we give a classification of orientably-regular embeddings of Q n for all n. In particular, we show that for all even n (=2m), these embeddings are in one-to-one correspondence with elements 驴 of order 1 or 2 in the symmetric group S n such that 驴 fixes n, preserves the set of all pairs B i ={i,i+m} for 1驴i驴m, and induces the same permutation on this set as the permutation B i 驴 B f(i) for some additive bijection f:驴 m 驴驴 m . We also give formulae for the numbers of embeddings that are reflexible and chiral, respectively, showing that the ratio of reflexible to chiral embeddings tends to zero for large even n.