GATE CSE
First time here? Checkout the FAQ!
x
+4 votes
407 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 (56.2k points)   | 407 views

3 Answers

+4 votes
Best answer

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

answer = option C

answered by Veteran (27k points)  
selected by
+2 votes

Ans C 

answered by Veteran (10.2k points)  
–3 votes
The max degree of the vertex is 4 so we need atleast 5 colours to colour the graph
answered by Veteran (12.8k points)  
4 colours are enough here !
It is a planar graph so we need only 4 colour.
Top Users Jan 2017
  1. Debashish Deka

    8126 Points

  2. sudsho

    5042 Points

  3. Habibkhan

    4706 Points

  4. Vijay Thakur

    4458 Points

  5. Bikram

    4348 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4010 Points

  8. santhoshdevulapally

    3722 Points

  9. GateSet

    3292 Points

  10. Sushant Gokhale

    3286 Points

Monthly Topper: Rs. 500 gift card

19,122 questions
24,034 answers
52,724 comments
20,276 users