For example, a puzzle could have nine letters, shapes ... Thus, in the language of graph theory, solving a sudoku means extending a partial coloring of the graph into a proper coloring.

This is the case with an important problem in computer science called "graph isomorphism testing" whereby scientists use ...