1609.08370Sep 27, 20166 pages, 2 figures. Since cographs are disjoint unions of graphs with domination numbers one or two, this result is implied by the work of Bartsalkin and German. However, the techniques presented are new and may be useful to other researchers in the field