Elegant First Fit Algorithm Graph Coloring. If we consider the vertices. Also, the number of colors used sometime depend on the order in which vertices are processed.
Source: www.geeksforgeeks.org
Note that in graph on right side, vertices 3 and 4 are swapped. The above algorithm doesn’t always use minimum number of colors. Also, the number of colors used sometime depend on the order in which vertices are processed.
The above algorithm doesn’t always use minimum number of colors. Let’s think of graph coloring as a game with two. If we consider the vertices.
For example, consider the following two graphs. Also, the number of colors used sometime depend on the order in which vertices are processed.
