A constraint on the biembedding of Latin squares

DOI10.1016/j.ejc.2008.05.007zbMath1170.05017OpenAlexW2014853538MaRDI QIDQ1003587

Terry S. Griggs, Michael John Grannell, Diane M. Donovan, James G. Lefevre

Publication date: 4 March 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.05.007

zbMATH Keywords

Latin squareorientable surfaceCayley tablebi-embeddingmain class

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

Face 2-Colorable Embeddings with Faces of Specified Lengths, On parity vectors of Latin squares, THERE ARE ASYMPTOTICALLY THE SAME NUMBER OF LATIN SQUARES OF EACH PARITY, A lower bound for the number of orientable triangular embeddings of some complete graphs

Cites Work

• On the number of 8\(\times 8\) Latin squares
• Genus embeddings for some complete tripartite graphs
• Recursive constructions for triangulations
• BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item