The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same colour, is
2
3
4
5
This question is part of this quiz :
Top MCQs on Graph Theory in Mathematics,GATE-CS-2004,Topic Wise Quiz on Graph Theory,Discrete mathematics PYQ GATE QUIZ