Stability number in subclasses of \(P_5\)-free graphs
From MaRDI portal
Publication:1764380
DOI10.1007/s11766-004-0045-6zbMath1057.05063OpenAlexW2039180066MaRDI QIDQ1764380
Igor Edm. Zverovich, Olga I. Zverovich
Publication date: 24 February 2005
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-004-0045-6
Related Items (2)
Extending the MAX algorithm for maximum independent set ⋮ New sufficient conditions for \(\alpha\)-redundant vertices
Cites Work
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- Penta-extensions of hereditary classes of graphs
- On the stability number of claw-free \(P_5\)-free and more general graphs
- On semi-\(P_ 4\)-sparse graphs
- On the use of Boolean methods for the computation of the stability number
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- Minimum degree algorithms for stability number
- Stabex method for extension of \(\alpha\)-polynomial hereditary classes.
- Stability in \(P_5\)- and banner-free graphs
- Extension of hereditary classes with substitutions
- On graphs with polynomially solvable maximum-weight clique problem
- Construction of a Maximum Stable Set with $k$-Extensions
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- A note on \(\alpha\)-redundant vertices in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stability number in subclasses of \(P_5\)-free graphs
