Chromatic (itch) (aloska)

Chromatic its relax puzzle game without timer. You need to color all vertices. Thats all! But ... neighboring vertices cannot have the same color. So, the aim is to use the fewest number of colors, and the chromatic number of a graph is the smallest number of colors that suffice for a coloring. You will begin with vertex coloring, where one colors the vertices of a graph in such a way that adjacent vertices get different colors. You will start with some easy examples, and then move on to more co...