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
Step 0: Study the topic/subject. Use Bikram ...