On Biembeddings of Latin Squares

  • M. J. Grannell
  • T. S. Griggs
  • M. Knor

Abstract

A known construction for face 2-colourable triangular embeddings of complete regular tripartite graphs is re-examined from the viewpoint of the underlying Latin squares. This facilitates biembeddings of a wide variety of Latin squares, including those formed from the Cayley tables of the elementary Abelian 2-groups $C_2^k$ ($k\ne 2$). In turn, these biembeddings enable us to increase the best known lower bound for the number of face 2-colourable triangular embeddings of $K_{n,n,n}$ for an infinite class of values of $n$.

Published
2009-08-21
How to Cite
Grannell, M. J., Griggs, T. S., & Knor, M. (2009). On Biembeddings of Latin Squares. The Electronic Journal of Combinatorics, 16(1), R106. https://doi.org/10.37236/195
Article Number
R106