Skip to content
Related Articles
Open in App
Not now

Related Articles

GATE | GATE-CS-2004 | Question 77

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

The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same colour, is

(A) 2
(B) 3
(C) 4
(D) 5

Answer: (C)

Explanation: graph coloring

Two vertices are said to be adjacent if they are directly connected, i.e., there is a direct edge between them.
So, here, we can assign same color to 1 & 2 (red), 3 & 4 (grey), 5 & 7 (blue) and 6 & 8 (brown).
Therefore, we need a total of 4 distinct colors.

Thus, C is the correct choice.


Please comment below if you find anything wrong in the above post.

Quiz of this Question

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!