Highly Influenced

# Dominating sets in perfect graphs

@article{Corneil1990DominatingSI, title={Dominating sets in perfect graphs}, author={Derek G. Corneil and Lorna Stewart}, journal={Discrete Mathematics}, year={1990}, volume={86}, pages={145-164} }

- Published 1990 in Discrete Mathematics
DOI:10.1016/0012-365X(90)90357-N

Since their introduction by Claude Berge in the early 1960s [2], perfect graphs have attracted considerable attention, and many interesting families of graphs have been shown to be contained in the perfect graphs. Perfect graphs are graphs in which the maximum clique size is equal to the chromatic number for every induced subgraph. One of the problems which has been widely studied in relation to these graphs is that of finding a minimum dominating set. In this paper, we review the results in… CONTINUE READING