On the complexity of minimum \(q\)-domination partization problems (Q2125219)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of minimum \(q\)-domination partization problems |
scientific article |
Statements
On the complexity of minimum \(q\)-domination partization problems (English)
0 references
13 April 2022
0 references
domination coloring
0 references
\(q\)-domination partization
0 references
node deletion problem
0 references
approximation algorithm
0 references
0 references
0 references
