Hardness results of global total \(k\)-domination problem in graphs (Q5918768)
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: Hardness results of global total \(k\)-domination problem in graphs |
scientific article; zbMATH DE number 7567756
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results of global total \(k\)-domination problem in graphs |
scientific article; zbMATH DE number 7567756 |
Statements
Hardness results of global total \(k\)-domination problem in graphs (English)
0 references
4 August 2022
0 references
domination
0 references
NP-completeness
0 references
APX-completeness
0 references
