Author:
Grannell M. J.,Griggs T. S.,Knor M.
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$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献