On the chromatic number of Latin square graphs

DOI10.1016/j.disc.2016.04.025zbMath1339.05036arXiv1510.02521OpenAlexW2230116819MaRDI QIDQ2629269

Nazli Besharati, Ebadollah S. Mahmoodian, Luis A. Goddyn, M. Mortezaeefar

Publication date: 5 July 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.02521

zbMATH Keywords

Latin squaretransversalcoloringorthogonal arrayCayley tableLatin square graphspartial transversalorthogonal matenet graphs

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (10)

Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups ⋮ Notes on Latin square graphs and their domination numbers ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ All group‐based latin squares possess near transversals ⋮ The chromatic number of finite group Cayley tables ⋮ Programming with MATLAB to color latin squares ⋮ Colouring games based on autotopisms of Latin hyper-rectangles ⋮ A new algorithmic method to compute the chromatic number of dihedral group ⋮ On domination number of Latin square graphs of finite cyclic groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transversals of latin squares and their generalizations
• A new conjecture concerning admissibility of groups
• The admissibility of sporadic simple groups.
• Strongly regular graphs, partial geometries and partially balanced designs
• Small latin squares, quasigroups, and loops
• Near-optimal list colorings
• A note on finite abelian groups
• Complete mappings of finite groups
• A generalization of transversals for Latin squares

This page was built for publication: On the chromatic number of Latin square graphs