Dominating bipartite subgraphs in graphs
Gábor Bacsó, Danuta Michalak, Zsolt Tuza (2005)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is hereditarily dominated by a class 𝓓 of connected graphs if each connected induced subgraph of G contains a dominating induced subgraph belonging to 𝓓. In this paper we characterize graphs hereditarily dominated by classes of complete bipartite graphs, stars, connected bipartite graphs, and complete k-partite graphs.