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
5166 Points
4204 Points
3748 Points
2986 Points
2298 Points
2234 Points
2142 Points
1998 Points
1626 Points
1552 Points
Gatecse