Stable sets versus independent sets

DOI10.1016/0012-365X(93)90325-NzbMath0783.05036OpenAlexW2068255817MaRDI QIDQ686148

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

matroidsNP-hardindependent 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)

Related Items (4)

Labelled induced subgraphs and well-quasi-ordering ⋮ Canonical antichains of unit interval and bipartite permutation graphs ⋮ Two forbidden induced subgraphs and well-quasi-ordering ⋮ Matrix formulation of EISs of graphs and its application to WSN covering problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean techniques for matroidal decomposition of independence systems and applications to graphs
• The NP-Completeness of Edge-Coloring
• Subgraphs and well‐quasi‐ordering
• Matroids and the greedy algorithm
• Ordering by Divisibility in Abstract Algebras

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