00:01
In this question, we need to determine whether the following statements are true or false.
00:06
The first statement says, if every vertex of graph has degree 6 or less, that means, every vertex degree is less than or equal to 6, then the chromatic number of the graph, that is chi of g, it is the chromatic number of the graph is at to the most 6, that means, it is less or equal to 6.
00:32
So, clearly, this statement is false, it need not be the case.
00:39
So, this is going to be false.
00:41
Now, let us move to the next statement, it says, if h is a sub graph of g, so we have been given h sub graph of g, then it says that the chromatic number of h will be same as the chromatic number of g.
01:04
So, this statement is clearly true.
01:09
Since h is a sub graph of g, we will get that chromatic number of h will be same as chromatic number of g.
01:17
Since it contains, it can have only those edges which are already there in g.
01:23
So, we say this is true...