Stable sets versus independent sets

DOI10.1016/0012-365X(93)90325-NMaRDI QIDQ686148zbMATH OpenOpenAlexFDO

Authors Guoli Ding

Publication date 10 March 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90325-n

zbMATH Keywords

NP-hardmatroidsindependent setsstable setsmatroidal number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 4187860
• scientific article; zbMATH DE number 6266
• scientific article; zbMATH DE number 3150
• scientific article; zbMATH DE number 4139804
• On the number of vertices belonging to all maximum stable sets of a graph

Cites work

• scientific article; zbMATH DE number 3856849 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Boolean techniques for matroidal decomposition of independence systems and applications to graphs
• Matroids and the greedy algorithm
• Ordering by Divisibility in Abstract Algebras
• Subgraphs and well‐quasi‐ordering
• The NP-Completeness of Edge-Coloring

Cited in

(7)

• scientific article; zbMATH DE number 4139804 (Why is no real title available?)
• Matrix formulation of EISs of graphs and its application to WSN covering problems
• scientific article; zbMATH DE number 4187860 (Why is no real title available?)
• Stable multi-sets
• Two forbidden induced subgraphs and well-quasi-ordering
• Labelled induced subgraphs and well-quasi-ordering
• Canonical antichains of unit interval and bipartite permutation graphs

This page was built for publication: Stable sets versus independent sets

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