1 votes 1 votes Consider a tree with n nodes, where a node can be adjacent to maximum 4 other nodes.Then the minimum number of color needed to color the tree, so that no two adjacent node gets same color? Graph Theory graph-theory graph-coloring numerical-answers + – srestha asked Dec 9, 2016 recategorized Jul 7, 2022 by Lakshman Bhaiya srestha 660 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply dd commented Dec 9, 2016 reply Follow Share answer 2 ??? 1 votes 1 votes srestha commented Dec 9, 2016 reply Follow Share why? because it's a tree can take 1 color in each level,rt? 0 votes 0 votes dd commented Dec 9, 2016 reply Follow Share I think same 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes 2 colours are required as it is tree no cycle so one colour will be for each level 0 then one colour for level 1 then first colour for level 2 and so on... shayal chhabra answered Dec 12, 2016 shayal chhabra comment Share Follow See all 0 reply Please log in or register to add a comment.