Mosca, Raffaele Independent sets in (\(P_{6}\),diamond)-free graphs. (English) Zbl 1196.05065 Discrete Math. Theor. Comput. Sci. 11, No. 1, 125-140 (2009). Summary: We prove that on (\(P_{6}\),diamond)-free graphs the Maximum Weight Independent Set problem and the Minimum Weight Independent Dominating Set problem can be solved in polynomial time. Cited in 8 Documents MSC: 05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) 05C85 Graph algorithms (graph-theoretic aspects) PDFBibTeX XMLCite \textit{R. Mosca}, Discrete Math. Theor. Comput. Sci. 11, No. 1, 125--140 (2009; Zbl 1196.05065) Full Text: Link