GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
461 views

The number of colours required to properly colour the vertices of every planer graph is

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

3 Answers

+2 votes
Best answer

According to the 4-color theorem states that the vertices of every planar graph can be colored with at most 4 colors so that no two adjacent vertices receive the same color.

 

Hence,Option(C)4 is the correct choice

answered by Veteran (31.7k points)  
selected by
0 votes
acc. to 4-color theorem 4 colours are needed to color any simple graph

https://en.wikipedia.org/wiki/Four_color_theorem
answered by Veteran (44.5k points)  
0 votes
answer is a
answered by (71 points)  


Top Users Aug 2017
  1. Bikram

    4902 Points

  2. ABKUNDAN

    4704 Points

  3. akash.dinkar12

    3480 Points

  4. rahul sharma 5

    3158 Points

  5. manu00x

    3012 Points

  6. makhdoom ghaya

    2480 Points

  7. just_bhavana

    2388 Points

  8. stblue

    2138 Points

  9. Tesla!

    2060 Points

  10. joshi_nitish

    1758 Points


25,014 questions
32,139 answers
74,822 comments
30,185 users