On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs

Abstract

We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained graphs. We show that the problem is linear time solvable for bipartite permutation graphs and NP-hard for grid intersection graphs. We also show that the problem is solvable in O(n²log ⁶n) time for n-vertex graphs with maximum degree at most three.