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.
Domains
Discrete Mathematics [cs.DM]
Origin : Files produced by the author(s)
Loading...