Gate CS-2016-2 Question Paper With Solutions

Q. 13 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]

(A) 1

(B) 2

(C) 3

(D) 4

Answer: (D)

Explanation:

Gate CS-2016-2 Question Paper With Solutions

Learn More:   Gate EE-2014-3 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here