Q23MCQ2 marks, −0.5Which of the following statements is true for every planar graph on nnn vertices?(A)The graph is connected(B)The graph is Eulerian(C)The graph has a vertex-cover of size at most 3n4\frac{3n}{4}43n(D)The graph has an independent set of size at least n3\frac{n}{3}3nSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google