Solving a Sudoku with constraint propagation and Graph coloring

Given a sudoku, a graph is formed making the adjacent nodes those that CAN'T have the same color (number) The coloring is done following the constraints of sudoku and using constraint propagation