English

The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs

Combinatorics 2021-09-27 v2

Abstract

We prove that the Minimum Dominating Set problem is polynomial for the class of (claw, P8)-free graphs.

Cite

@article{arxiv.2001.07554,
  title  = {The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs},
  author = {Valentin Bouquet and Christophe Picouleau},
  journal= {arXiv preprint arXiv:2001.07554},
  year   = {2021}
}
R2 v1 2026-06-23T13:16:35.957Z