Which of the following statements is true for every planar graph on n vertices?
GATE · 2008 · CS
Which of the following statements is true for every planar graph on n vertices?
- A.
The graph has a vertex-cover of size at most 3n/4
- B.
The graph is Eulerian
- C.
The graph is connected
- D.
The graph has an independent set of size at least n/3
Attempted by 244 students.
Sign up free to check your answer
Sign up freeLoading lesson…