First time here? Checkout the FAQ!
+4 votes

If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is

  1. 1
  2. k
  3. k-1
  4. k/2
asked in Graph Theory by Veteran (87.2k points)   | 943 views

2 Answers

+6 votes
Best answer
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
answered by Veteran (25.2k points)  
selected by
+2 votes
B.chromatic number is the number to color a graph with minimum number of colors. so ans is K
answered by Loyal (3.4k points)  
chromatic number is  n only for complete graph.Here in the question it is not mentioned whether it is complete or not
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.

Top Users Sep 2017
  1. Habibkhan

    6338 Points

  2. Warrior

    2220 Points

  3. Arjun

    2162 Points

  4. nikunj

    1980 Points

  5. manu00x

    1726 Points

  6. SiddharthMahapatra

    1718 Points

  7. Bikram

    1716 Points

  8. makhdoom ghaya

    1660 Points

  9. A_i_$_h

    1518 Points

  10. rishu_darkshadow

    1512 Points

25,982 questions
33,556 answers
31,014 users