NP-completeness results for partitioning a graph into total dominating sets (Q5918107): Difference between revisions
From MaRDI portal
Latest revision as of 07:28, 22 July 2024
scientific article; zbMATH DE number 7187633
Language | Label | Description | Also known as |
---|---|---|---|
English | NP-completeness results for partitioning a graph into total dominating sets |
scientific article; zbMATH DE number 7187633 |
Statements
NP-completeness results for partitioning a graph into total dominating sets (English)
0 references
7 April 2020
0 references
total domatic number
0 references
graph theory
0 references
computational complexity
0 references
combinatorics
0 references