Forbidden minors to graphs with small feedback sets (Q5931421)
From MaRDI portal
scientific article; zbMATH DE number 1591073
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Forbidden minors to graphs with small feedback sets |
scientific article; zbMATH DE number 1591073 |
Statements
Forbidden minors to graphs with small feedback sets (English)
0 references
8 July 2001
0 references
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.
0 references
graph minor
0 references
feedback sets
0 references
constructive method
0 references
