Best Graph Coloring Algorithm Pseudo-Code. Since d is maximum degree, a vertex cannot be attached to more than d vertices. Here d is the maximum degree in the given graph.
Source: imgbin.comWhen we color a vertex, at most dcolors could have already been used by its adjacent. Here d is the maximum degree in the given graph. Since d is maximum degree, a vertex cannot be attached to more than d vertices.
