Finding augmenting chains in extensions of claw-free graphs
From MaRDI portal
(Redirected from Publication:1007635)
Recommendations
Cites work
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
- Augmenting graphs for independent sets
- Computing independent sets in graphs with large girth
- On maximal independent sets of vertices in claw-free graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- Paths, Trees, and Flowers
- 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
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- Stability in \(P_5\)- and banner-free graphs
- Stable sets in certain \(P_6\)-free graphs
- Stable sets in two subclasses of banner-free graphs
- TWO THEOREMS IN GRAPH THEORY
Cited in
(9)- On the use of augmenting chains in chain packings
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- Augmenting chains in graphs without a skew star.
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs
- Maximum weight independent sets in classes related to claw-free graphs
- Some new hereditary classes where graph coloring remains NP-hard
- On finding augmenting graphs
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
This page was built for publication: Finding augmenting chains in extensions of claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007635)
