Disjoint Paired-Dominating sets in Cubic Graphs.

A paired-dominating set of a graph is a dominating set with the additional requirement that the induced subgraph [] contains a perfect matching. We prove that the vertex set of every claw-free cubic graph can be partitioned into two paired-dominating sets.