A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary (Q5146828)
From MaRDI portal
scientific article; zbMATH DE number 7304080
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary |
scientific article; zbMATH DE number 7304080 |
Statements
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary (English)
0 references
2 February 2021
0 references
