|
|
@@ -2129,8 +2129,6 @@ The reader may be more familiar with the graph coloring problem then he
|
|
|
or she realizes; the popular game of Sudoku is an instance of the
|
|
|
graph coloring problem. The following describes how to build a graph
|
|
|
out of an initial Sudoku board.
|
|
|
-\marginpar{\scriptsize To do: create a figure with a Sudoku
|
|
|
-board and its corresponding graph. --Jeremy}
|
|
|
\begin{itemize}
|
|
|
\item There is one node in the graph for each Sudoku square.
|
|
|
\item There is an edge between two nodes if the corresponding squares
|
Jeremy Siek