GATE | CS | 2016 | Set 2 | Discrete Maths | Graph theory | Question 13

Last Updated :
Discuss
Comments

The minimum number of colours that is sufficient to vertex-colour any planar graph is _______________ [This Question was originally a Fill-in-the-blanks Question]

1

2

3

4

This question is part of this quiz :

Top MCQs on Graph Theory in Mathematics,GATE-CS-2016 (Set 2),Topic Wise Quiz on Graph Theory,Discrete mathematics PYQ GATE QUIZ
Tags:
Engineering Mathematics Questions
GATE
Computer Subject
Discrete Mathematics
+1 More
Share your thoughts in the comments