1 votes 1 votes How to find number of ways for coloring a graph with 'm' colors for following graphs a)connected graph(with no cycles) b)regular graph Graph Theory graph-theory graph-coloring + – Harish Karnam asked Nov 21, 2017 Harish Karnam 630 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes For r- regular graph we will need a minimum of r color (ex - C5)and maximum of n-1 color. (Ex - K5). A connected graph with no cycles is a tree and the chromatic number of a tree is 2. ( > 1 Vertex). smsubham answered Dec 19, 2017 edited Dec 19, 2017 by smsubham smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes chromatic number of k regular graph is n Equivalence relation between vertices of same color in a connected graph gives the chromatic partition. nikkey123 answered Nov 21, 2017 nikkey123 comment Share Follow See all 2 Comments See all 2 2 Comments reply Harish Karnam commented Nov 21, 2017 reply Follow Share Equivalence relation between vertices of same color in a connected graph Can you explain this with little more detail 0 votes 0 votes hs_yadav commented Nov 21, 2017 reply Follow Share i think chromatic no. of k-regular graph depend on the grpah structure but for a connected grpah with no cycle 2 color are sufficient for coloring bcoz in this every single node is connected to at most two node..????? 1 votes 1 votes Please log in or register to add a comment.