8 votes 8 votes If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is $1$ $k$ $k-1$ $k/2$ Graph Theory isro2007 graph-theory graph-coloring + – go_editor asked Jun 10, 2016 • edited Dec 8, 2022 by Lakshman Bhaiya go_editor 4.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes The chromatic number of a graph is the smallest number of colors needed to color the vertices so that no two adjacent vertices share the same color. Ans- Chromatic number = k vijaycs answered Jun 2, 2016 • selected Apr 25, 2017 by Deepthi_ts vijaycs comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes B.chromatic number is the number to color a graph with minimum number of colors. so ans is K Pranabesh Ghosh 1 answered Jun 10, 2016 Pranabesh Ghosh 1 comment Share Follow See all 2 Comments See all 2 2 Comments reply Neeraj Singh commented Jul 15, 2016 reply Follow Share chromatic number is n only for complete graph.Here in the question it is not mentioned whether it is complete or not 0 votes 0 votes LeenSharma commented Jul 15, 2016 reply Follow Share yes, in question it is not given that it is complete or not. But here it is not necessary. If a graph colored with n color then chromatic number should be n.Right?Read Question Properly. 0 votes 0 votes Please log in or register to add a comment.