The graph coloring problem asks for a k-coloring of a given graph, if one exists.
The graph coloring problem is NP-Complete, and so currently there are no known polynomial-time solutions to the problem.
All planar graphs has a 4 coloring.
Greedy: Sequential coloring
Order colors in a sequential order. Color a vertex in the first available color in the sequence.