in Others
280 views
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
in Others
280 views

1 Answer

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
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true