Forbidden minors to graphs with small feedback sets (Q5931421)

Finite obstruction set characterizations for lower ideals in the minor order are guaranteed to exist by the graph minor theorem. In this paper, the authors characterize several families of graphs with small feedback sets. Their constructive methods can compute obstruction sets for any minor-closed family of graphs, provided the pathwidth (or treewidth) of the largest obstruction is known.