Construction of a Maximum Stable Set with k-Extensions

DOI10.1017/S0963548304006376MaRDI QIDQ4680569zbMATH OpenFDO

Authors Peter L. Hammer, I.È. Zverovich

Publication date 7 June 2005

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548304006376

zbMATH Keywords

forbidden subgraphsgraph algorithmshereditary classesindependent set

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 637274
• On strongly k-extendable graphs
• scientific article; zbMATH DE number 871171
• scientific article; zbMATH DE number 2077671
• Well-covered graphs and extendability

Cited in

(4)

• Stability number in subclasses of \(P_5\)-free graphs
• Conditional matching preclusion for regular bipartite graphs and their Cartesian product
• Stable sets for (P_{6}, K_{2,3})-free graphs
• Contructions of some new nonextandable P_k sets

This page was built for publication: Construction of a Maximum Stable Set with $k$-Extensions

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