2 votes 2 votes Consider a tree with n nodes where and node can adjacent to maximum 4 other nodes .then what is the minimum number of colours needed to colour the tree so that no two adjacent nodes get the same colour Graph Theory graph-theory + – Parshu gate asked Nov 13, 2017 Parshu gate 433 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Anu007 commented Nov 13, 2017 reply Follow Share Frame question . 0 votes 0 votes Parshu gate commented Nov 13, 2017 reply Follow Share Consider a graph with n nodes where and node can adjacent to maximum 4 other nodes .then what is the minimum number of colours needed to colour the tree so that no two adjacent nodes get the same colour 0 votes 0 votes Rishabh Gupta 2 commented Nov 14, 2017 reply Follow Share @Parshu for the graph question. I think it will be 5. Because at max a vertex can be adjacent to 4 other vertices. In worst case, it will be a complete graph with 5 vertices. 1 votes 1 votes Please log in or register to add a comment.
