Some results on maximum stable sets in certain P₅-free graphs
From MaRDI portal
Publication:1414592
Recommendations
- \(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 the stable set problem in special \(P_{5}\)-free graphs
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
Cites work
- A New Algorithm for Generating All the Maximal Independent Sets
- A characterization of graphs without long induced paths
- A note on \(\alpha\)-redundant vertices in graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Dominating cliques in \(P_ 5\)-free graphs
- Irredundance perfect andP6-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 minimal imperfect graphs without induced P₅
- On the stability number of claw-free \(P_5\)-free and more general graphs
- 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
- Stability in \(P_5\)- and banner-free graphs
- The Complexity of the Partial Order Dimension Problem
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
Cited in
(23)- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
- On the stable set problem in special \(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
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Stability in \(P_5\)- and banner-free graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- On the number of vertices belonging to all maximum stable sets of a graph
- New applications of clique separator decomposition for the maximum weight stable set problem
- Tent and a subclass of \(P_{5}\)-free graphs
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- On indicated coloring of graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Stable sets in two subclasses of banner-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
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- \(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
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs
- Penta-extensions of hereditary classes of graphs
This page was built for publication: Some results on maximum stable sets in certain \(P_{5}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1414592)
