Question

Find the chromatic number required by the graph G​

Answer 1

Answer:

If d is the largest of the degrees of the vertices in a graph G, then G has a proper coloring with d + 1 or fewer colors, i.e., the chromatic number of G is at most d + 1. This gives an upper bound on the chromatic number, but the real chromatic number may be below this upper bound.