NP-completeness results for partitioning a graph into total dominating sets (Q5920155): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2886376538 / rank | |||
Normal rank | |||
Latest revision as of 21:14, 19 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
