Is feedback vertex set problem is solvable in polynomial time for some special graph Feedback vertex set (FVS) problem is NP-complete for both undirected and directed graphs, and it is NP-complete even for bipartite graphs and tournaments.

Is there any special family of graphs other than trees for which FVS is solvable in polynomial time? I kindly request you to throw some light on it.
Surely the problem is polytime for graphs of bounded treewidth via dynamic programming.