recategorized by
1,911 views
3 votes
3 votes

What are the chromatic number of following graphs?

Answer is 6 and 4 respectively.But i am getting 3 for both.

Please someone confirm this?

recategorized by

3 Answers

Best answer
12 votes
12 votes

Yes we can color both of them with 3 color so that no two same color is adjacent. but how can we sure that it is not less than 3. As both the graph consist triangle it can't be color with less than 3. So we at least require 3 color to color them.

Moreover they are planer graph, according to four color theorem : The chromatic number of a planar graph is no greater than four.
https://en.wikipedia.org/wiki/Four_color_theorem

selected by

Related questions

2 votes
2 votes
0 answers
1
Parshu gate asked Nov 11, 2017
1,141 views
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G) a)2 b)3 C)4 d)none of these
9 votes
9 votes
0 answers
2
Mk Utkarsh asked Jan 10, 2018
1,066 views
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is
9 votes
9 votes
2 answers
3
3 votes
3 votes
1 answer
4
rahul sharma 5 asked Jun 7, 2017
1,254 views
What is the vertex connectivity and edge connectivity of complete graph?Is it n or n-1?