Question 19
Suppose Nitya wishes to find the minimum cost spanning tree of the graph given below. While finding the minimum cost spanning tree she finds that a few edge weights are missing (x and y) but she is sure that the weight of the minimum cost spanning tree is 15 in the graph.
Based on the above data, answer the given subquestions.
What is the minimum number of colors required to properly color the vertices of the given graph such that no two adjacent vertices share the same color?