The number of colours required to properly colour the vertices of every planer graph is
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
3152 Points
1616 Points
1580 Points
1326 Points
1230 Points
1028 Points
1012 Points
972 Points
810 Points
662 Points
242 Points
138 Points
112 Points
104 Points
63 Points
Gatecse