Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
type: Item
instance of: scholarly article
title: Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
zbMATH Open document ID: 1197.05148
author: Frédéric Maffray
published in: Information Processing Letters
publication date: 2010-09-02T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5778931
zbMATH Keywords: graph algorithm
zbMATH Keywords: stability
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.09.006
OpenAlex ID: W1993788757
cites work: Q4198056
cites work: On the stable set problem in special \(P_{5}\)-free graphs
cites work: Coloring the hypergraph of maximal cliques of a graph with no long path
cites work: Q5749319
cites work: A Note on k-Colorability of P 5-Free Graphs
cites work: Q4448764
cites work: Maximum independent sets in subclasses of \(P_{5}\)-free graphs
cites work: Threshold graphs and related topics
cites work: Computing independent sets in graphs with large girth
cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
cites work: The complexity of coloring graphs without long induced paths
DOI: 10.1016/J.IPL.2009.09.006
description: scientific article; zbMATH DE number 5778931