On the stable set problem in special \(P_{5}\)-free graphs
type: Item
instance of: scholarly article
title: On the stable set problem in special \(P_{5}\)-free graphs
zbMATH Open document ID: 1028.05103
DOI: 10.1016/S0166-218X(01)00321-3
author: Michael U. Gerber
author: Vadim Lozin
published in: Discrete Applied Mathematics
publication date: 2003-03-09T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 1878519
zbMATH Keywords: stable set
zbMATH Keywords: stability number
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks
cites work: Local transformations of graphs preserving independence number
cites work: On (\(P_{5}\), diamond)-free graphs
cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\)
cites work: On the stability number of claw-free \(P_5\)-free and more general graphs
cites work: A note on \(\alpha\)-redundant vertices in graphs
cites work: Four classes of perfectly orderable 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: An upper bound on the number of cliques in a graph
cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
cites work: On semi-\(P_ 4\)-sparse graphs
cites work: Q3216686
cites work: Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
cites work: Quasimonotone Boolean Functions and Bistellar Graphs
cites work: Murky graphs
cites work: Polynomially solvable cases for the maximum stable set problem
cites work: On the use of Boolean methods for the computation of the stability number
cites work: Q4505839
cites work: Stability in \(P_5\)- and banner-free graphs
cites work: Linear recognition of pseudo-split 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: Q4770411
cites work: A New Algorithm for Generating All the Maximal Independent Sets
full work available at URL: s0166-218x(01)00321-3
OpenAlex ID: W2059639406
description: scientific article; zbMATH DE number 1878519