Computing chromatic number is an NP – Complete problem. It is the minimum number of colors required to color a graph so that no two adjacent vertices have the same color. See mathworld…
Computing chromatic number is an NP – Complete problem. It is the minimum number of colors required to color a graph so that no two adjacent vertices have the same color. See mathworld…