Characterization of graphs dominated by induced paths

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 (k⩾3k⩾3). We show, in particular, that k=4k=4 means precisely the class of domination-reducible graphs, whose original definition applied four types of structural reduction.