×

Sudoku squares and chromatic polynomials. (English) Zbl 1177.05022

The authors recall the notions of \(\lambda\)-coloring, proper coloring and chromatic number of a graph and introduce so-called Sudoku graph to address the Sudoku puzzles. It is proved that the Sudoku graph of rank \(n\) has chromatic number \(n^2\). Some results on the number of the solutions and the number of Sudoku squares are obtained as well.

MSC:

05B30 Other designs, configurations
05C15 Coloring of graphs and hypergraphs
PDFBibTeX XMLCite