Npc Problems: Vertex Coloring is a minimalistic puzzle game about a real computacional problem. Linked circles cannot have the same color, can you paint all the circles using the minimal number of colors? Additional information: The vertex coloring problem is represented by a graph, which is a set of nodes and lines. The lines connect the vertices and are called edges. The vertex coloring problem is one of the complete non-polynomial (NP-complete) problems. These problems cant be solved by today’s computers, they could spend several years to get the solution, depending…