0 votes 0 votes If a graph requires k different colors for its proper coloring, then chromatic number of the graph is (a) 1 (b) k (c) k-1 (d) k/2 Others graph-theory + – Sriya sarkar asked Nov 17, 2018 Sriya sarkar 318 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes The definition of chromatic number is minimum number of different colors required to color a graph hence chromatic number is k only sandygate answered Nov 17, 2018 sandygate comment Share Follow See all 0 reply Please log in or register to add a comment.
