In graph theory, precoloring extension is the problem of extending a graph coloring of a subset of the vertices of a graph, with a given set of colors, to a coloring of the whole graph that does not assign the same color to any two adjacent vertices.
and 4 Related for: Precoloring extension information
In graph theory, precoloringextension is the problem of extending a graph coloring of a subset of the vertices of a graph, with a given set of colors...
puzzle. The problem of solving a Sudoku puzzle can be represented as precoloringextension on this graph. It is an integral Cayley graph. On a Sudoku board...
to its solution, one involving graph coloring (more precisely, precoloringextension of the Sudoku graph) and another involving using the Gröbner basis...
Global Information