In this paper, we study the undirected minimum-cardinality feedback vertex set problem in outer-planar graphs and present a polynomial time algorithm to solve it.