1 paper
Tobias Riege, Jörg Rothe
The three domatic number problem asks whether a given undirected graph can be partitioned into at least three dominating sets, i.e., sets whose closed neighborhood equals the verte…