scientific article; zbMATH DE number 5761816

MaRDI QIDQ3575449zbMATH OpenFDO

Authors Raffaele Mosca

Publication date 27 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/509/0.html

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited in

(10)

• Extending the MAX algorithm for maximum independent set
• The maximum weight stable set problem in (\(P_6\), bull)-free graphs
• Independence and Efficient Domination on P ₆ -free Graphs
• On the chromatic number of (\(P_6\), diamond)-free graphs
• Weighted independent sets in classes of \(P_6\)-free graphs
• Independent sets in \((P_4+P_4\),triangle)-free graphs
• Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs
• Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
• Independent Sets in Classes Related to Chair-Free Graphs
• New sufficient conditions for \(\alpha\)-redundant vertices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575449)