Chromatic Number (Graph Coloring)

From Algorithm Wiki
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.

Related Problems

Related: k-Graph Coloring, 2-Graph Coloring, 3-Graph Coloring, 4-Graph Coloring, 5-Graph Coloring, #k-Graph Coloring, #2-Graph Coloring, #3-Graph Coloring, #4-Graph Coloring, #5-Graph Coloring


$n$: number of vertices

$m$: number of edges

Table of Algorithms

Currently no algorithms in our database for the given problem.