An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
type: Item
instance of: scholarly article
title: An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
zbMATH Open document ID: 1026.05098
DOI: 10.1016/S0166-218X(03)00221-X
author: R. Boliac
author: Vadim Lozin
published in: Discrete Applied Mathematics
publication date: 2003-11-20T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2006363
zbMATH Keywords: stable set
zbMATH Keywords: augmenting graph
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks
cites work: On minimal imperfect graphs without induced \(P_5\)
cites work: On the stability number of claw-free \(P_5\)-free and more general graphs
cites work: The complexity of generalized clique packing
cites work: A Linear Recognition Algorithm for Cographs
cites work: Stability number of bull- and chair-free graphs
cites work: Some simplified NP-complete graph problems
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: Q3216686
cites work: Stability in \(P_5\)- and banner-free graphs
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
cites work: Stable sets in certain \(P_6\)-free graphs
cites work: The strong perfect graph conjecture for pan-free graphs
cites work: Q4770411
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
full work available at URL: s0166-218x(03)00221-x
OpenAlex ID: W1989632159
description: scientific article; zbMATH DE number 2006363