What is coloring problem explain with suitable example?
Answers
Answered by
5
Answer:
Graph coloring problem is to assign colors to certain elements of a graph subject to certain constraints. Vertex coloring is the most common graph coloring problem. For example, the following can be colored minimum 3 colors. The problem to find chromatic number of a given graph is NP Complete.
Similar questions