In the mathematics of Sudoku, the Sudoku graph is an undirected graph whose vertices represent the cells of a (blank) Sudoku puzzle and whose edges represent...

Sudoku (/suːˈdoʊkuː, -ˈdɒk-, sə-/; Japanese: 数独, romanized: sūdoku, lit. 'digit-single'; originally called Number Place) is a logic-based, combinatorial...

A standard Sudoku contains 81 cells, in a 9×9 grid, and has 9 boxes, each box being the intersection of the first, middle, or last 3 rows, and the first...

Mathematics can be used to study Sudoku puzzles to answer questions such as "How many filled Sudoku grids are there?", "What is the minimal number of clues...

puzzle Sudoku. Graph coloring is still a very active field of research. Note: Many terms used in this article are defined in Glossary of graph theory...

integers. Like the 9 × 9 {\displaystyle 9\times 9} Sudoku graph it is an integral abelian Cayley graph whose group elements all have order 3, one of a small...

belief propagation can be used for Sudoku codes. Belief propagation on the tanner graph or factor graph to decode Sudoku codes is discussed in by Sayir....

should be distinguished from the Sudoku graph, a different 20-regular 81-vertex graph. The Sudoku graph is derived from Sudoku puzzles by making a vertex for...

of going from a Sudoku problem to its solution, one involving graph coloring (more precisely, precoloring extension of the Sudoku graph) and another involving...

vertices from the graph. Sudoku puzzles may be modeled mathematically as instances of the precoloring extension problem on Sudoku graphs. Colbourn, Charles...