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
Vinit Dhull 1 can you prove your point?
23356 Points
17058 Points
8142 Points
6254 Points
5438 Points
4968 Points
4772 Points
4298 Points
3964 Points
3794 Points
Gatecse
X->YZ , Y->XZ , ...