NP-completeness results for partitioning a graph into total dominating sets

Mikko Koivisto, Petteri Laakkonen, Juho Lauri. NP-completeness results for partitioning a graph into total dominating sets. Theoretical Computer Science, 818:22-31, 2020. [doi]

Abstract

Abstract is missing.