On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs
type: Item
instance of: scholarly article
title: On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs
zbMATH Open document ID: 1013.68290
DOI: 10.1016/S0020-0190(01)00265-4
author: Andreas Brandstädt
author: Hoàng-Oanh Le
author: Van Bang Le
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1767461
zbMATH Keywords: maximum stable set problem
zbMATH Keywords: \(P_5\)-free graphs
zbMATH Keywords: polynomial time
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
cites work: On graphs with polynomially solvable maximum-weight clique problem
cites work: A note on \(\alpha\)-redundant vertices in graphs
cites work: Q4198056
cites work: On the stable set problem in special \(P_{5}\)-free graphs
cites work: Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
cites work: Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
description: scientific article; zbMATH DE number 1767461