Arjun Suresh (talk | contribs) |
Arjun Suresh (talk | contribs) |
||
| Line 18: | Line 18: | ||
[[Category: GATE2009]] | [[Category: GATE2009]] | ||
| − | [[Category: Graph Theory questions | + | [[Category: Graph Theory questions from GATE]] |
| − | |||
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n > 2$.
(A) 2
(B) 3
(C) n-1
(D) n
Chromatic number of a graph is the minimum number of colors required to color all vertices such that no two adjacent vertices are colored with same color. Since here we have no odd cycle, we can color whole graph with only $2$ colors, coloring the vertices with alternate colors. So, option (A) is correct.
This work is licensed under the CC By-SA 3.0 , without all the cruft that would otherwise be put at the bottom of the page.
Sister Sites: GATE CSE Wiki, GATE CSE, Aptitude Overflow
GATECSE