A total dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set. In this note, we show that the vertex set of every graph with minimum degree at least two and with no component that is a \(5\)-cycle can be partitioned into a dominating set and a total dominating set.