NP-completeness results for partitioning a graph into total dominating sets (Q5920155): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:32, 2 February 2024
scientific article; zbMATH DE number 6796736
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness results for partitioning a graph into total dominating sets |
scientific article; zbMATH DE number 6796736 |
Statements
NP-completeness results for partitioning a graph into total dominating sets (English)
0 references
23 October 2017
0 references
