Maximum independent sets in subclasses of \(P_{5}\)-free graphs
type: Item
instance of: scholarly article
title: Maximum independent sets in subclasses of \(P_{5}\)-free graphs
zbMATH Open document ID: 1189.05136
author: Vadim Lozin
author: Raffaele Mosca
published in: Information Processing Letters
publication date: 2010-06-16T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5721994
zbMATH Keywords: graph algorithms
zbMATH Keywords: independent set
zbMATH Keywords: \(P_{5}\)-free graphs
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.11.005
OpenAlex ID: W2092129537
cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks
cites work: On (\(P_{5}\), diamond)-free graphs
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
cites work: A note on \(\alpha\)-redundant vertices in graphs
cites work: On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
cites work: Complement reducible graphs
cites work: Paths, Trees, and Flowers
cites work: On diameters and radii of bridged graphs
cites work: Q4193514
cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
cites work: \(P_{5}\)-free augmenting graphs and the maximum stable set problem
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: Trivially perfect graphs
cites work: Finding augmenting chains in extensions of claw-free graphs
cites work: Some classes of perfectly orderable graphs
cites work: Stability in \(P_5\)- and banner-free graphs
cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
cites work: Independent sets in extensions of 2\(K_{2}\)-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: Some results on maximum stable sets in certain \(P_{5}\)-free graphs
cites work: Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
cites work: Quasi-threshold graphs
DOI: 10.1016/J.IPL.2008.11.005
description: scientific article; zbMATH DE number 5721994