Q. 61 Which of the following statements is true for every planar graph on n vertices
(A) The graph is connected
(B) The graph is Eulerian
(C) The graph has a vertex-cover of size at most 3n/4
(D) The graph has an independent set of size at least n/3
Answer: (C)
Explanation:
