I need an algorythm to get the cromatic number of a graph.
- by Carlos Sanchez
Given the adjacency matrix of a graph, i need to obtain the cromatic number (minimum number of colours within you can paint every node of a graph). preferably it should be a java algoryhtm, and i don't care about performance. thanks.