Let be a simple, finite, undirected graph with vertex set . Let denote the maximum degree of and let denote the set of all possible colors.
Color the vertices of using the following greedy strategy:
Which of the following statements is/are TRUE?
code
- AThis procedure results in a proper vertex coloring of .
- BThe number of colors used is at most .
- CThe number of colors used is at most .
- DThe number of colors used is equal to the chromatic number of .

