Highly Influenced

# An induced subgraph characterization of domination perfect graphs

@article{Zverovich1995AnIS, title={An induced subgraph characterization of domination perfect graphs}, author={Igor E. Zverovich and Vadim E. Zverovich}, journal={Journal of Graph Theory}, year={1995}, volume={20}, pages={375-395} }

- Published 1995 in Journal of Graph Theory
DOI:10.1002/jgt.3190200313

Let y(G) and L(G) be the domination number and independent domination number of a graph G, respectively. A graph G is called domination perfect if y(H) = L(H) , for every induced subgraph H of G. There are many results giving a partial characterization of domination perfect graphs. In this paper, we present a finite induced subgraph characterization of the entire class of domination perfect graphs. The list of forbidden subgraphs in the characterization consists of 17 minimal domination… CONTINUE READING