On the complexity of reinforcement in graphs (Q339476)
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: On the complexity of reinforcement in graphs |
scientific article; zbMATH DE number 6651643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of reinforcement in graphs |
scientific article; zbMATH DE number 6651643 |
Statements
On the complexity of reinforcement in graphs (English)
0 references
11 November 2016
0 references
domination
0 references
total domination
0 references
total restrained domination
0 references
\(p\)-domination
0 references
\(k\)-rainbow domination
0 references
reinforcement
0 references
NP-hardness
0 references
