I am able to use induction method to partition the vertex set of any outerplanar graph into two sets say $X$ and $Y$ such that the two sets induce forests with maximum degree at most 2.
I was wondering if there could be any alternative method to do the proof?