Chromatic number of a graph
This functionality does not run in MATLAB.
Graph::chromaticNumber(G) returns the chromatic
number of the graph
G. The chromatic number of
a graph is defined to be the number of colors necessary to color it
such that no two adjacent vertices have the same color.
We compute the chromatic number of the complete graph with 5 vertices; it must be 5 since any two vertices are adjacent:
An undirected graph
Internally, the chromatic polynomial is used to compute the chromatic number.