Graph 3-coloring is in a class of problems called NP-complete. The purpose of my study is not to solve this problem in polynomial time, rather, it is to solve specific cases in better than O(3ⁿ) time using a grid of computers. If you wish to learn more about this problem and my approach, click on the links below.