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
8608 Points
5398 Points
4718 Points
4522 Points
4468 Points
4222 Points
4122 Points
3742 Points
3576 Points
3394 Points
Gatecse