1 votes 1 votes The number of colours required to properly colour the vertices of every planer graph is 2 3 4 5 Graph Theory ugcnetcse-june2012-paper2 graph-theory graph-coloring + – go_editor asked Jul 4, 2016 go_editor 9.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes 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 LeenSharma answered Jul 4, 2016 • selected Jul 8, 2016 by Arjun LeenSharma comment Share Follow See all 2 Comments See all 2 2 Comments reply Vinit Dhull 1 commented Aug 25, 2017 reply Follow Share This is for region not vertices correct anser is 5 0 votes 0 votes LeenSharma commented Aug 28, 2017 reply Follow Share Vinit Dhull 1 can you prove your point? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes acc. to 4-color theorem 4 colours are needed to color any simple graph https://en.wikipedia.org/wiki/Four_color_theorem Sanjay Sharma answered Jul 4, 2016 Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.