2015/10/08 by Nazli Besharati, Besharati, Nazli, Luis Goddyn +5
Computer Science · Engineering · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.1510.02521
openalex publication_date 2015/10/08 · arxiv created 2016/04/06 · arxiv updated 2016/10/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The chromatic number of a Latin square is the least number of partial transversals which cover its cells. This is just the chromatic number of its associated Latin square graph. Although Latin square graphs have been widely studied as strongly regular graphs, their chromatic numbers appear to be unexplored. We determine the chromatic number of a circulant Latin square, and find bounds for some other classes of Latin squares. With a computer, we find the chromatic number for all main classes of Latin squares of order at most eight.