Independent sets in (P₆, diamond)-free graphs
Raffaele Mosca · Discrete Mathematics & Theoretical Computer Science · 2009
Graphs and Algorithms 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.