Every cubic graph has four total dominating sets covering each vertex at most twice

Hyemin Kwon, Boram Park, Yoshio Sano

In 2018, Goddard and Henning conjectured that every cubic graph has four total dominating sets covering each vertex at most twice, and asked the analogous question for transversals…