Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T06:15:49.695Z Has data issue: false hasContentIssue false
  • English
  • Français

MAXIMUM GENUS EMBEDDINGS OF LATIN SQUARES

Part of:Graph theoryDesigns and configurations

Published online by Cambridge University Press:  30 October 2017

TERRY S. GRIGGS,
CONSTANTINOS PSOMAS and
JOZEF ŠIRÁŇ
TERRY S. GRIGGS
Affiliation:
Department of Mathematics and Statistics, The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom e-mail: t.s.griggs@open.ac.uk
CONSTANTINOS PSOMAS
Affiliation:
Department of Electrical and Computer Engineering, University of Cyprus, Nicosia 1678, Cyprus e-mail: psomas@ucy.ac.cy
JOZEF ŠIRÁŇ
Affiliation:
Department of Mathematics and Statistics, The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom e-mail: j.siran@open.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

It is proved that every non-trivial Latin square has an upper embedding in a non-orientable surface and every Latin square of odd order has an upper embedding in an orientable surface. In the latter case, detailed results about the possible automorphisms and their actions are also obtained.

MSC classification

Primary:05B15: Orthogonal arrays, Latin squares, Room squares
Secondary:05C10: Planar graphs; geometric and topological aspects of graph theory

Information

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 60 , Issue 2 , May 2018, pp. 495 - 504
Copyright
Copyright © Glasgow Mathematical Journal Trust 2017 

References

REFERENCES

1. Grannell, M. J., Griggs, T. S. and Knor, M., Biembeddings of Latin squares and Hamiltonian decompositions, Glasgow Math. J. 46 (3) (2004), 443–457.CrossRefGoogle Scholar
2. Grannell, M. J., Griggs, T. S. and Širáň, J., Maximum genus embeddings of Steiner triple systems, European J. Combin. 26 (3–4) (2005), 401–416.CrossRefGoogle Scholar
3. Gross, J. L. and Tucker, T. W., Topological graph theory (John Wiley, New York, 1987).Google Scholar
4. Mendelsohn, N. S., A natural generalization of Steiner triple systems, in Computers in number theory (Academic Press, New York, 1971), 323–338.Google Scholar
5. Ringel, G., Map color theorem (Springer-Verlag, New York, 1974).CrossRefGoogle Scholar