Chromatic Number (Graph Coloring)
Jump to navigation Jump to search
In this case, we wish to compute the chromatic number of a graph; that is, the smallest number of colors needed to color the graph.
$n$: number of vertices
$m$: number of edges
Table of Algorithms
Currently no algorithms in our database for the given problem.