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}
}
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

References

Publications referenced by this paper.
Showing 1-10 of 38 references

A dynamic programming approach to the dominating set problem on k-trees

  • D. G. Corneil, J. M. Keil
  • SIAM J. Algebraic Discrete Methods
  • 1987

A . A . Bertossi and M . A . Bonuccelli , Hamiltonian circuits in interval graph generalizations

  • A. Proskurowski Beyer, S. Hedetniemi
  • Inform . Process . Lett .
  • 1986

Dominating cycles in series-parallel graphs

  • C. J. Colbourn, L. K. Stewart
  • Ars Combin
  • 1985

Similar Papers

Loading similar papers…