edited by
745 views
8 votes
8 votes

Consider the following graph:

 Which of the following will represents the chromatic number of the graph?

answer given is 4.

Please provide a detailed solution.

edited by

2 Answers

0 votes
0 votes

Now to find the chromatic no of the graph we need to find the chromatic partitioning of this graph. 

So, to find chromatic partitioning of a graph G enumerate through all maximal independent set of graph G and take the minimum number of these sets which collectively include all vertices of G.

The maximal independent sets of this graph are

{a,e}, {a,d}, {a,h}, {b,d}, {b,f}.{b,e}, {c,g}, {c,e}, {e,g}.

Now from among these maximal independent set of vertices, we have to select the minimum number of such sets which can include all vertices of the graph and one such way is

{a,d} , {b,f} , {c,e}, {e,g}

This is the chromatic partitioning of this graph and since each one is an independent set we can assign a single color to color all the vertices within an independent set and we need 4 colors to color these 4 sets. So our graph only needs 4 colors for proper coloring

Hence, the chromatic number of this graph is 4.

You can refer to the below question and see the answer by   ma'am and  sir for more reference. 

https://gateoverflow.in/204092/gate2018-18?show=204092#q204092 

  Sir could you please check whether its the right approach or not?

 

Related questions

3 votes
3 votes
1 answer
1
0 votes
0 votes
1 answer
3
Sahil_Lather asked Apr 15, 2023
439 views
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...
4 votes
4 votes
2 answers
4
Balaji Jegan asked Nov 27, 2018
2,499 views
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ?There is a condition that adjacent...