Stable sets in k-colorable P₅-free graphs
From MaRDI portal
Publication:990082
DOI10.1016/J.IPL.2009.09.006zbMATH Open1197.05148OpenAlexW1993788757MaRDI QIDQ990082FDOQ990082
Authors: Frédéric Maffray 
Publication date: 2 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.09.006
Recommendations
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- On 3-colorable \(P_5\)-free graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- Some results on stable sets for \(k\)-colorable \(P_{6}\)-free graphs and generalizations
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- Threshold graphs and related topics
- Title not available (Why is that?)
- The complexity of coloring graphs without long induced paths
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
- A Note on k-Colorability of P 5-Free Graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Computing independent sets in graphs with large girth
Cited In (14)
- A one-to-one correspondence between colorings and stable sets
- Domination, coloring and stability in \(P_5\)-reducible graphs
- Combining decomposition approaches for the maximum weight stable set problem
- On the stable set problem in special \(P_{5}\)-free graphs
- A Note on k-Colorability of P 5-Free Graphs
- Stability in \(P_5\)- and banner-free graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
- Some results on stable sets for \(k\)-colorable \(P_{6}\)-free graphs and generalizations
- Towards Erdős-Hajnal for graphs with no 5-hole
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- Penta-extensions of hereditary classes of graphs
- On 3-colorable \(P_5\)-free graphs
This page was built for publication: Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990082)
