Computer Sciences > Gate 2016 Set-2 > Graph Theory
The minimum number of colours that is sufficient to vertex-colour any planar graph is _______________
Explanation
Correct : a
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.