Some results on maximum stable sets in certain \(P_{5}\)-free graphs
From MaRDI portal
Publication:1414592
DOI10.1016/S0166-218X(03)00399-8zbMath1029.05146MaRDI QIDQ1414592
Publication date: 4 December 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs ⋮ New applications of clique separator decomposition for the maximum weight stable set problem ⋮ On indicated coloring of graphs ⋮ Maximum weight independent sets in odd-hole-free graphs without dart or without bull ⋮ Independent domination in finitely defined classes of graphs: polynomial algorithms ⋮ First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs ⋮ On the structure of (\(P_{5}\),\,gem)-free graphs ⋮ Independent sets in extensions of 2\(K_{2}\)-free graphs ⋮ Maximum independent sets in subclasses of \(P_{5}\)-free graphs ⋮ Finding augmenting chains in extensions of claw-free graphs
Cites Work
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- On diameters and radii of bridged graphs
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Dominating cliques in \(P_ 5\)-free graphs
- On minimal imperfect graphs without induced \(P_5\)
- On the stability number of claw-free \(P_5\)-free and more general graphs
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- Stability in \(P_5\)- and banner-free graphs
- On (\(P_{5}\), diamond)-free graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- A characterization of graphs without long induced paths
- The Complexity of the Partial Order Dimension Problem
- A New Algorithm for Generating All the Maximal Independent Sets
- Irredundance perfect andP6-free graphs
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- A note on \(\alpha\)-redundant vertices in graphs
