Np Problems: Vertex Coloring

"Npc Problems: Vertex Coloring" is a minimalistic puzzle game based on a real computational problem, where you solve handcrafted instances of the NP-complete vertex coloring problem. The goal is to color the linked circles in a graph with the minimum number of colors, without having any two connected circles share the same color. The game features a relaxing neon graphics environment and original synthwave music. Note that this problem is NP-complete, meaning it could take modern computers years to solve, depending on the size of the problem.