Tree GRAPH colourable – Discrete Math

Question 1 UGC NET June-2020    
Consider the following statements:
A) Any tree is 2-colorable
B) A graph G has no cycles of even length if it is bipartite
C) A graph G is 2-colorable if is bipartite
D) A graph G can be colored with d+1 colors if d is the maximum degree of any vertex in the graph G
E) A graph G can be colored with O(log|v|) colors if it has O(|v|) edges.
Choose the correct answer from the options given below:
A – (C) and (E) are incorrect
B – (B) and (C) are incorrect
C – (B) and (E) are incorrect
D – (A) and (D) are incorrect

Show Answer With Best Explanation

Answer: C

error: Content is protected !!
Open chat
Hi,how Can We Help You ?