Large induced subgraph with a given pathwidth in outerplanar graphs

Naoki Matsumoto, Takamasa Yashima, Hikaru Yokoi

A long-standing conjecture by Albertson and Berman in 1979 states that every planar graph of order $n$ has an induced forest with at least $\lceil \frac{n}{2}\rceil$ vertices. As…