What is chromatic number of the above graph?
Note : Chromatic number is the minimum number of color to color the vertex of a graph so that adjacent vertex are not of the same color.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Relevant wiki: Graph Coloring and Chromatic Numbers
There need 4 color to color the vertex of the graph.4 is the minimum number of color.Because notice that,there is some triangles in the graph.So,the 3 vertex of the triangle are mutually connected.So,there must need 3 color.Another vertex is connected with three of the vertex of the triangle.So,that vertex must be of differrent color.So,4 color must be needed.