Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs

Marco D'Elia, Fabrizio Frati

In this paper, we study the following question. Let $\mathcal{G}$ be a family of planar graphs and let $k\ge 3$ be an integer. What is the largest value $f_k(n)$ such that every $n…