The graph coloring problem consists of a graph and a limited number of available colors. The task is, to label the vertices of the graph with colors, under the condition, that two cannot have the same color when they are connected through an edge.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
The graph coloring problem consists of a graph and a limited number of available colors. The task is, to label the vertices of the graph with colors, under the condition, that two cannot have the same color when they are connected through an edge.