The graph below shows the total number of publications each year in Graph Reconfiguration and Coloring Problems. References [1] Strong inequalities and a branch-and-price algorithm for the convex ...

In the sudoku graph, this would mean a properly solved puzzle would have no two nodes connected which are the same color—since connections only run along row, columns, and throughout subgrids.