For example ... Once each vertex is colored and no two connected vertices have the same color, the coloring is called “proper.” Thus, in the language of graph theory, solving a sudoku means ...