Characterization of graphs dominated by induced paths Original Research Article

We give a characterization, in terms of forbidden induced subgraphs, of those graphs in which every connected induced subgraph has a dominating induced path on at most k vertices (image). We show, in particular, that image means precisely the class of domination-reducible graphs, whose original definition applied four types of structural reduction.