Dominating Bipartite Subgraphs in Graphs
Gábor Bacsó, Danuta Michalak, Zs. Tuza · Discussiones Mathematicae Graph Theory · 2005
A graph G is hereditarily dominated by a class D of connected graphs if each connected induced subgraph of G contains a dominating induced subgraph belonging to D. In this paper we characterize graphs hereditarily dominated by classes of complete bipartite graphs, stars, connected bipartite graphs, and complete k-partite graphs.