HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

Valentin Bouquet 1, 2 Christophe Picouleau 1
1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
2 CEDRIC - ROC - CEDRIC. Réseaux et Objets Connectés
CEDRIC - Centre d'études et de recherche en informatique et communications
Abstract : We prove that the Minimum Dominating Set problem is polynomial for the class of (claw, P8)-free graphs.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02448239
Contributor : Valentin Bouquet Connect in order to contact the contributor
Submitted on : Monday, September 27, 2021 - 10:49:51 AM
Last modification on : Monday, February 21, 2022 - 3:38:20 PM

File

2001.07554.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02448239, version 2
  • ARXIV : 2001.07554

Collections

Citation

Valentin Bouquet, Christophe Picouleau. The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs. 2021. ⟨hal-02448239v2⟩

Share

Metrics

Record views

120

Files downloads

92