Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Engineering Mathematics Graph Theory Matching
Consider the following statements for connected graph:
(i). A graph is bipartite if and only if it is two colourable.
(ii). A cycle graph with even vertices is bipartite.
(iii). A a graph is bipartite if and only if it does not contain an odd cycle.
(iv). A tree is a bipartite graph.
Which of the above statement/s is/are TRUE?
1
(i) and (ii) only
2
(ii) and (iv) only
3
(i), (iii) and (iv) only
4
All are true
5
Question Not Attempted