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
3704 Points
1484 Points
1432 Points
1408 Points
1311 Points
1194 Points
1132 Points
994 Points
932 Points
930 Points
1960 Points
1306 Points
502 Points
410 Points
388 Points
Gatecse
@Arjun Sir the problem is not with the ...