Complexity results for equistable graphs and related classes
From MaRDI portal
Publication:646721
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Equistable chordal graphs
- Equistable distance-hereditary graphs
- Equistable graphs
- Equistable series-parallel graphs
- Independent Sets of Maximum Weight in Apple-Free Graphs
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- New applications of clique separator decomposition for the maximum weight stable set problem
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- Threshold graphs and related topics
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
Cited in
(9)- Short proofs on the structure of general partition, equistable and triangle graphs
- Strong cliques and equistability of EPT graphs
- Equivalence of strongly connected graphs and black-and-white 2-SAT problems
- Linear separation of connected dominating sets in graphs
- Recognizing \(k\)-equistable graphs in FPT time
- Equistarable graphs and counterexamples to three conjectures on equistable graphs
- On the recognition of \(k\)-equistable graphs
- Equistable simplicial, very well-covered, and line graphs
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
This page was built for publication: Complexity results for equistable graphs and related classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646721)
