NP-completeness results for partitioning a graph into total dominating sets (Q5918107): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.04.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2018.04.006 / rank | |||
Normal rank | |||
Latest revision as of 16:30, 16 December 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
