Maximum induced forests of planar graphs
We propose following two conjectures: 1) If G is a planar graph of order \(n\geq 4\), then there exist \(\lceil \frac{n}{2}\rceil\) vertices in G which induce a forest. 2) If G is a planar graph of order n, then it has a stable set with \(\lceil \frac{n}{4}\rceil\) vertices.
scientific article; zbMATH DE number 4065012