GATE CSE
First time here? Checkout the FAQ!
x
+5 votes
518 views

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

  1. 2
  2. 3
  3. 4
  4. 5
asked in Graph Theory by Veteran (58.2k points)   | 518 views

3 Answers

+6 votes
Best answer

4 colors are required to color the graph in the prescribed way.

answer = option C

answered by Veteran (27.5k points)  
selected by
Practical approach :)
+2 votes

Ans C 

answered by Veteran (10.3k points)  
–3 votes
The max degree of the vertex is 4 so we need atleast 5 colours to colour the graph
answered by Veteran (13k points)  
4 colours are enough here !
It is a planar graph so we need only 4 colour.


Top Users Mar 2017
  1. rude

    4272 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2608 Points

  5. Debashish Deka

    2244 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1338 Points

  8. Akriti sood

    1246 Points

  9. Bikram

    1246 Points

  10. Sanjay Sharma

    1016 Points

Monthly Topper: Rs. 500 gift card

21,452 questions
26,771 answers
60,972 comments
22,985 users