Dominating sets with small clique covering number

Motivated by earlier work on dominating cliques, we show that if a graph G is connected and contains no induced subgraph isomorphic to P₆ or H_t (the graph obtained by subdividing each edge of K_1,t, t ≥ 3, by exactly one vertex), then G has a dominating set which induces a connected graph with clique covering number at most t − 1. © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 101–105, 1997