Graph Coloring

One of the most interesting assignments was this one. It's goal was to color a graph. A coloring of an undirected graph is an assignment of a label to each node. It is required that the labels on the pair of nodes incident to any edge be different. A minimum coloring of a graph is a coloring that uses as few different labels as possible.

The program was written in C and compiled for win32 and linux.

Get it for Linux or Win32