On the stable set problem in special P₅-free graphs
From MaRDI portal
Publication:1861559
Recommendations
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
Cites work
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 1512194 (Why is no real title available?)
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A New Algorithm for Generating All the Maximal Independent Sets
- A note on \(\alpha\)-redundant vertices in graphs
- An upper bound on the number of cliques in a graph
- Four classes of perfectly orderable graphs
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Linear recognition of pseudo-split graphs
- Local transformations of graphs preserving independence number
- Murky graphs
- On (\(P_{5}\), diamond)-free graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- On maximal independent sets of vertices in claw-free graphs
- On semi-\(P_ 4\)-sparse graphs
- On the stability number of claw-free \(P_5\)-free and more general graphs
- On the use of Boolean methods for the computation of the stability number
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- Polynomially solvable cases for the maximum stable set problem
- Quasimonotone Boolean Functions and Bistellar Graphs
- Stability in \(P_5\)- and banner-free graphs
- Stability number of bull- and chair-free graphs
- The complexity of generalized clique packing
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
Cited in
(35)- Extending the MAX algorithm for maximum independent set
- scientific article; zbMATH DE number 2190095 (Why is no real title available?)
- On maximum independent sets in \(P_{5}\)-free graphs
- Domination, coloring and stability in \(P_5\)-reducible graphs
- Struction revisited
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
- Stability number in subclasses of \(P_5\)-free graphs
- Robust algorithms for the stable set problem
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- Some results on graphs without long induced paths
- Stability in \(P_5\)- and banner-free graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Maximum weight independent sets in hole- and dart-free graphs
- New applications of clique separator decomposition for the maximum weight stable set problem
- Weighted independent sets in a subclass of P₆-free graphs
- Partitioning graphs into connected parts
- Partitioning Graphs into Connected Parts
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- On (\(P_{5}\), diamond)-free graphs
- Hitting all maximum stable sets in \(P_5\)-free graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Finding augmenting chains in extensions of claw-free graphs
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
- On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs
- Some results on stable sets for \(k\)-colorable \(P_{6}\)-free graphs and generalizations
- On sequential heuristic methods for the maximum independent set problem
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- New sufficient conditions for \(\alpha\)-redundant vertices
- On 3-colorable \(P_5\)-free graphs
This page was built for publication: On the stable set problem in special \(P_{5}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861559)
