GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
383 views

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 (75.6k points)   | 383 views

2 Answers

+2 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
answered by Veteran (24.4k points)  
+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.1k 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 Feb 2017
  1. Arjun

    5288 Points

  2. Bikram

    4230 Points

  3. Habibkhan

    3952 Points

  4. Aboveallplayer

    3086 Points

  5. Debashish Deka

    2378 Points

  6. sriv_shubham

    2308 Points

  7. Smriti012

    2236 Points

  8. Arnabi

    2008 Points

  9. mcjoshi

    1690 Points

  10. sh!va

    1684 Points

Monthly Topper: Rs. 500 gift card

20,860 questions
26,010 answers
59,673 comments
22,113 users