Stable sets for (P_{6}, K_{2,3})-free graphs

DOI10.7151/DMGT.1598MaRDI QIDQ4648774zbMATH OpenOpenAlexFDO

Authors Raffaele Mosca

Publication date 16 November 2012

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1598

zbMATH Keywords

\(P_6\)-free graphsgraph algorithmsstable sets

Mathematics Subject Classification ID

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

Recommendations

• Stable sets in certain \(P_6\)-free graphs
• Some results on stable sets for \(k\)-colorable \(P_{6}\)-free graphs and generalizations
• scientific article; zbMATH DE number 4059411
• scientific article; zbMATH DE number 3998494
• scientific article; zbMATH DE number 4130806
• Construction of a Maximum Stable Set with k-Extensions
• Stable set polytopes in a higher dimensional space
• An application of the Lovász-Schrijver M(K, K) operator to the stable set problem
• On the stable equivalence problem for \(k[x,y]\)
• Stable multi-sets

Cited in

(9)

• An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
• Stable sets in two subclasses of banner-free graphs
• Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
• Extending the MAX algorithm for maximum independent set
• New sufficient conditions for \(\alpha\)-redundant vertices
• One-three join: a graph operation and its consequences
• Augmenting approach for some maximum set problems
• On cycle transversals and their connected variants in the absence of a small linear forest
• Connected vertex cover for \((sP_1+P_5)\)-free graphs

This page was built for publication: Stable sets for (P_{6}, K_{2,3})-free graphs

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