Stability in P₅- and banner-free graphs
From MaRDI portal
Publication:1580977
DOI10.1016/S0377-2217(99)00460-9zbMATH Open0952.90042OpenAlexW1999679245MaRDI QIDQ1580977FDOQ1580977
Authors: Vadim Lozin 
Publication date: 14 September 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00460-9
Recommendations
- Stability number in subclasses of \(P_5\)-free graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- Stable sets in two subclasses of banner-free graphs
- On the stability number of claw-free \(P_5\)-free and more general graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
- Vertex-critical \((P_5\), banner)-free graphs
- A note on stability for maximal \(F\)-free graphs
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
Cites Work
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Title not available (Why is that?)
- A New Algorithm for Generating All the Maximal Independent Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- On maximal independent sets of vertices in claw-free graphs
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- Title not available (Why is that?)
- Stability number of bull- and chair-free graphs
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- On the use of Boolean methods for the computation of the stability number
- Polynomially solvable cases for the maximum stable set problem
- On semi-\(P_ 4\)-sparse graphs
- Local transformations of graphs preserving independence number
Cited In (22)
- On independent vertex sets in subclasses of apple-free graphs
- Struction revisited
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- Stabex method for extension of \(\alpha\)-polynomial hereditary classes.
- Stability number in subclasses of \(P_5\)-free graphs
- A survey on graphs with convex quadratic stability number
- On finding augmenting graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- New applications of clique separator decomposition for the maximum weight stable set problem
- Weighted independent sets in a subclass of \(P_6\)-free graphs
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Stable sets in two subclasses of banner-free graphs
- A note on \(\alpha\)-redundant vertices in graphs
- Finding augmenting chains in extensions of claw-free graphs
- Maximum independent sets in subclasses of \(P_{5}\)-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 clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Augmenting graphs for independent sets
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
This page was built for publication: Stability in \(P_5\)- and banner-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1580977)
