Hereditarily dominated graphs Original Research Article

A graph G is hereditarily dominated by a class of connected graphs image if each connected induced subgraph of G contains a dominating induced subgraph belonging to image. In this paper, we determine graphs hereditarily dominated by classes of cycles and paths, paths, trees and trees with a bounded diameter. In each case, a characterization in terms of forbidden induced subgraphs is given.