Cool Graph Coloring Algorithm Pseudo-Code. Here d is the maximum degree in the given graph. To color this vertex, we need to pick the smallest numbered color that is not used by the adjacent.
Source: www.gatevidyalay.com
Here d is the maximum degree in the given graph. When we color a vertex, at most dcolors could have already been used by its adjacent. Since d is maximum degree, a vertex cannot be attached to more than d vertices.
To color this vertex, we need to pick the smallest numbered color that is not used by the adjacent. 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.
