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
Answer
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!