Maximum independent sets in subclasses of P₅-free graphs
From MaRDI portal
Publication:976106
Recommendations
- On maximum independent sets in \(P_{5}\)-free graphs
- Independent set in \(P_5\)-free graphs in polynomial time
- On the stable set problem in special \(P_{5}\)-free graphs
- A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs
- Stable sets in certain \(P_6\)-free graphs
Cites work
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- A note on \(\alpha\)-redundant vertices in graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-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
- Complement reducible graphs
- Finding augmenting chains in extensions of claw-free graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- On (\(P_{5}\), diamond)-free graphs
- On diameters and radii of bridged graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- On maximal independent sets of vertices in claw-free graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-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
- Quasi-threshold graphs
- Some classes of perfectly orderable graphs
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- Stability in \(P_5\)- and banner-free graphs
- TWO THEOREMS IN GRAPH THEORY
- Trivially perfect graphs
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
Cited in
(23)- Maximum weight independent sets in hole- and co-chair-free graphs
- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
- Extending the MAX algorithm for maximum independent set
- On maximum independent sets in \(P_{5}\)-free graphs
- Domination, coloring and stability in \(P_5\)-reducible graphs
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs
- The complexity of dissociation set problems in graphs
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
- Stability number in subclasses of \(P_5\)-free graphs
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- New results on independent sets in extensions of \(2K_2\)-free graphs
- \textsc{max-cut} and containment relations in graphs
- Some results on graphs without long induced paths
- Independent Feedback Vertex Set for P_5-free Graphs
- Max-Cut and containment relations in graphs
- Independent set in \(P_5\)-free graphs in polynomial time
- Tent and a subclass of \(P_{5}\)-free graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- On the complexity of the independent set problem in triangle graphs
- An exact algorithm for maximum independent set in degree-5 graphs
- A sufficient condition to extend polynomial results for the maximum independent set problem
- On mirror nodes in graphs without long induced paths
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
This page was built for publication: Maximum independent sets in subclasses of \(P_{5}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976106)
