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
4902 Points
4704 Points
3480 Points
3158 Points
3012 Points
2480 Points
2388 Points
2138 Points
2060 Points
1758 Points
Gatecse