Complexity of the cluster vertex deletion problem on \(H\)-free graphs (Q6584072)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of the cluster vertex deletion problem on \(H\)-free graphs |
scientific article; zbMATH DE number 7893106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the cluster vertex deletion problem on \(H\)-free graphs |
scientific article; zbMATH DE number 7893106 |
Statements
Complexity of the cluster vertex deletion problem on \(H\)-free graphs (English)
0 references
6 August 2024
0 references
cluster vertex deletion
0 references
vertex cover
0 references
computational complexity
0 references
complexity dichotomy
0 references
