GATE CSE
First time here? Checkout the FAQ!
x
+6 votes
569 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.9k points)   | 569 views

3 Answers

+8 votes
Best answer

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

answer = option C

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

Ans C 

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


Top Users May 2017
  1. akash.dinkar12

    3152 Points

  2. pawan kumarln

    1616 Points

  3. sh!va

    1580 Points

  4. Arjun

    1336 Points

  5. Devshree Dubey

    1230 Points

  6. Angkit

    1028 Points

  7. Debashish Deka

    1012 Points

  8. Bikram

    972 Points

  9. LeenSharma

    810 Points

  10. srestha

    662 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. pawan kumarln

    242 Points

  2. Ahwan

    138 Points

  3. joshi_nitish

    112 Points

  4. jjayantamahata

    104 Points

  5. Arjun

    64 Points


22,725 questions
29,056 answers
65,052 comments
27,566 users