On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs
From MaRDI portal
Publication:1603536
DOI10.1016/S0020-0190(01)00265-4zbMath1013.68290MaRDI QIDQ1603536
Andreas Brandstädt, Hoàng-Oanh Le, Van Bang Le
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Maximum weight independent sets in hole- and co-chair-free graphs, New applications of clique separator decomposition for the maximum weight stable set problem, Independent sets in extensions of 2\(K_{2}\)-free graphs, Extending the MAX algorithm for maximum independent set, New sufficient conditions for \(\alpha\)-redundant vertices
Cites Work
- Unnamed Item
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- On graphs with polynomially solvable maximum-weight clique problem
- A note on \(\alpha\)-redundant vertices in graphs