The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2021

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

Abstract

We prove that the Minimum Dominating Set problem is polynomial for the class of (claw, P8)-free graphs.
Fichier principal
Vignette du fichier
2001.07554.pdf (244.53 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02448239 , version 1 (11-02-2020)
hal-02448239 , version 2 (27-09-2021)

Identifiers

Cite

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

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More