Independent sets in (P₆, diamond)-free graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2009

Independent sets in (P₆, diamond)-free graphs

Abstract

We prove that on the class of (P6,diamond)-free graphs the Maximum-Weight Independent Set problem and the Minimum-Weight Independent Dominating Set problem can be solved in polynomial time.
Fichier principal
Vignette du fichier
509-4151-2-PB.pdf (175.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00988179 , version 1 (07-05-2014)

Identifiers

Cite

Raffaele Mosca. Independent sets in (P₆, diamond)-free graphs. Discrete Mathematics and Theoretical Computer Science, 2009, Vol. 11 no. 1 (1), pp.125--140. ⟨10.46298/dmtcs.473⟩. ⟨hal-00988179⟩

Collections

TDS-MACS
128 View
842 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More