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
4272 Points
2994 Points
2804 Points
2608 Points
2244 Points
1414 Points
1338 Points
1246 Points
1016 Points
Gatecse
UGC NET papers