Skip to content
Related Articles
Open in App
Not now

Related Articles

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

Improve Article
Save Article
  • Difficulty Level : Basic
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

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

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!