Given a factoring of a graph, the factor domination number γf is the smallest number of nodes which dominate all factors. General results, mainly involving bounds on γf for factoring of arbitrary graphs, are presented, and some of these are generalizations of well known relationships. The special case of two-factoring Kp into a graph G and its complement receives special emphasis.