If all the edge rules are satisfied the graph is satisfiabl…
If all the edge rules are satisfied the graph is satisfiable.
If not go back to step (1) and try another color {c'}.
If all the colors have been tried, then the graph is not satisfiable.
If all the edge rules are satisfied the graph is satisfiable.
If not go back to step (1) and try another color {c'}.
If all the colors have been tried, then the graph is not satisfiable.