A constraint on the biembedding of Latin squares

Authors:
J. G. Lefevre;D. M. Donovan;M. J. Grannell;T. S. Griggs
Affiliations:
Centre for Discrete Mathematics and Computing, University of Queensland, St Lucia 4072, Australia;Centre for Discrete Mathematics and Computing, University of Queensland, St Lucia 4072, Australia;Department of Mathematics and Statistics, The Open University, Walton Hall, Milton Keynes MK7 6AA, United Kingdom;Department of Mathematics and Statistics, The Open University, Walton Hall, Milton Keynes MK7 6AA, United Kingdom
Venue:
European Journal of Combinatorics
Year:
2009

Citing 4
Cited 1

Topological graph theory

Topological graph theory
On the number of 8 x 8 Latin squares

Journal of Combinatorial Theory Series A
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Recursive constructions for triangulations

Journal of Graph Theory

A lower bound for the number of orientable triangular embeddings of some complete graphs

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a necessary condition for the biembedding of two Latin squares in an orientable surface. As a consequence, it is shown that for n=2, there is no biembedding of two Latin squares both lying in the same main class as the square obtained from the Cayley table of the Abelian 2-group C"2^n.