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
2 CEDRIC - ROC - CEDRIC. Réseaux et Objets Connectés

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

Mots clés: Minimum Dominating Set; polynomial time; claw-free graph; Pk -free graph

Domaines: Algorithme et structure de données [cs.DS]; Mathématique discrète [cs.DM]; Combinatoire [math.CO]; Informatique [cs]

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