Stable sets versus independent sets

DOI10.1016/0012-365X(93)90325-NzbMATH Open0783.05036OpenAlexW2068255817MaRDI QIDQ686148FDOQ686148

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The NP-Completeness of Edge-Coloring
• Subgraphs and well‐quasi‐ordering
• Matroids and the greedy algorithm
• Ordering by Divisibility in Abstract Algebras
• Boolean techniques for matroidal decomposition of independence systems and applications to graphs

Cited In (5)

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

Recommendations

• On the number of vertices belonging to all maximum stable sets of a graph 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)