Stable sets in two subclasses of banner-free graphs
type: Item
instance of: scholarly article
title: Stable sets in two subclasses of banner-free graphs
zbMATH Open document ID: 1029.05145
DOI: 10.1016/S0166-218X(03)00395-0
author: Michael U. Gerber
author: Alain Hertz
author: Vadim Lozin
published in: Discrete Applied Mathematics
publication date: 2003-12-04T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2012957
zbMATH Keywords: Stable set
zbMATH Keywords: Augmenting graphs
zbMATH Keywords: Polynomial algorithm
MaRDI profile type: Publication
cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks
cites work: Augmenting graphs for independent sets
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: Robust algorithms for the stable set problem
cites work: On Representatives of Subsets
cites work: Stability in \(P_5\)- and banner-free graphs
cites work: Q4229265
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: Computing independent sets in graphs with large girth
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)00395-0
OpenAlex ID: W2079563996
description: scientific article; zbMATH DE number 2012957