GATE CSE
First time here? Checkout the FAQ!
x
+3 votes
318 views

What is the chromatic number of the following graph?

GATE2008-IT_3

  1. 2
  2. 3
  3. 4
  4. 5
asked in Graph Theory by Veteran (18.4k points)  
edited by | 318 views

1 Answer

+11 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.

Hence minimum number of colors needed to color given graph is equal to 3( option 2

For odd length cycles we need minimum 3 colors for vertex coloring and for even length cycles we need just 2. 

answered by (367 points)  
selected by
Top Users Jan 2017
  1. Debashish Deka

    9660 Points

  2. sudsho

    5554 Points

  3. Bikram

    5280 Points

  4. Habibkhan

    4878 Points

  5. Vijay Thakur

    4498 Points

  6. Arjun

    4418 Points

  7. saurabh rai

    4236 Points

  8. Sushant Gokhale

    4140 Points

  9. Kapil

    3848 Points

  10. santhoshdevulapally

    3808 Points

Monthly Topper: Rs. 500 gift card

19,443 questions
24,221 answers
53,871 comments
20,372 users