NP-completeness results for partitioning a graph into total dominating sets (Q5920155): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:04, 5 March 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
