Grannell, Mike and Knor, Martin
Biembeddings of Latin squares obtained from a voltage construction.
Australasian Journal of Combinatorics, 51 pp. 259–270.
(Click here to request a copy from the OU Author.
We investigate a voltage construction for face -colourable triangulations by from the viewpoint of the underlying Latin squares. We prove that if the vertices are relabelled so that one of the Latin squares is exactly the Cayley table of the group , then the other square can be obtained from by a cyclic permutation of row, column or entry identifiers, and we identify these cyclic permutations. As an application, we improve the previously known lower bound for the number of nonisomorphic triangulations by obtained from the voltage construction in the case when is a prime number.
Actions (login may be required)