What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n >= 2.
Explanation: The chromatic number of a graph is the smallest number of colours needed to colour the vertices of so that no two adjacent vertices share the same colour. These types of questions can be solved by substitution with different values of n.
Here, in this graph let us suppose vertex A is coloured with C1 and vertices B, C can be coloured with colour C2 => chromatic number is 2 In the same way, you can check with other values, Chromatic number is equals to 2
This solution contributed by Anil Saikrishna Devarasetty
- GATE | GATE CS 2008 | Question 23
- GATE | GATE-CS-2009 | Question 3
- GATE | GATE CS 2013 | Question 2
- GATE | GATE CS 2011 | Question 17
- GATE | Gate IT 2008 | Question 26
- GATE | GATE CS 2018 | Question 65
- GATE | GATE CS 2018 | Question 64
- GATE | GATE CS 2018 | Question 63
- GATE | GATE CS 2018 | Question 62
- GATE | GATE CS 2018 | Question 61