Hereditarily dominated graphs

A graph G is hereditarily dominated by a class of connected graphs D if each connected induced subgraph of G contains a dominating induced subgraph belonging to D. 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.

[1]  Zsolt Tuza,et al.  Characterization of graphs dominated by induced paths , 2007, Discret. Math..

[2]  Zsolt Tuza,et al.  Graph Domination in Distance Two , 2005, Discuss. Math. Graph Theory.

[3]  Zsolt Tuza,et al.  Structural domination of graphs , 2002, Ars Comb..

[4]  Z. Tuza,et al.  Dominating cliques in P5-free graphs , 1990 .

[5]  Margaret B. Cozzens,et al.  Dominating cliques in graphs , 1991, Discret. Math..

[6]  E. S. Wolk.  The comparability graph of a tree , 1962 .

[7]  Zsolt Tuza,et al.  Dominating Bipartite Subgraphs in Graphs , 2005, Discuss. Math. Graph Theory.