Graph Coloring Problem: Color all the vertices of the graph such that no two adjacent vertices have the same color, but use of colors should be minimum. This is demonstration of “M Coloring Algorithm”. At most ‘M’ number of colors can be used.

**Video Rating: 3 / 5**

{ 1 comment… read it below or add one }

@mercede75 I’m afraid you’re mistaken. The only vertices not connected to D are B and G. Vertices are labeled A, B, C, D, E, F, G starting from the center vertex and going clockwise from the green on its left.

The blue node you mentioned (A) is adjacent to all other vertices.