A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary (Q5146828): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/1.9781611975994.57 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3001577222 / rank | |||
Normal rank | |||
Latest revision as of 20:49, 19 March 2024
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
