Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049)
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 \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs |
scientific article; zbMATH DE number 6904573
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs |
scientific article; zbMATH DE number 6904573 |
Statements
Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (English)
0 references
17 July 2018
0 references
total \(\{k\}\)-domination
0 references
\(k\)-tuple total domination
0 references
bipartite graph
0 references
computational complexity
0 references
0 references
