Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE-CS-2016 (Set 2) | Question 13

  • Difficulty Level : Basic
  • Last Updated : 28 Jun, 2021
Geek Week

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: A planar graph is a graph on a plane where no two edges are crossing each other.

The set of regions of a map can be represented more abstractly as an undirected graph that has a vertex for each region and an edge for every pair of regions that share a boundary segment. Hence the four color theorem is applied here.

Here is a property of a planar graph that a planar graph does not require more than 4 colors to color its vertices such that no two vertices have same color. This is known four color theorem.

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :