Free Graph Coloring Algorithm Pseudo-Code. 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.
Source: imgbin.com
To color this vertex, we need to pick the smallest numbered color that is not used by the adjacent. When 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.
To color this vertex, we need to pick the smallest numbered color that is not used by the adjacent. 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.
