1,066 views
9 votes
9 votes

The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is

Please log in or register to answer this question.

Related questions

3 votes
3 votes
3 answers
1
rahul sharma 5 asked Jun 12, 2017
1,911 views
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?
2 votes
2 votes
0 answers
2
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
1 votes
1 votes
1 answer
3
3 votes
3 votes
0 answers
4
Kabir5454 asked Jan 2, 2023
426 views
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?