The stable set polytope for some extensions of P₄-free graphs
DOI10.1016/J.DISC.2007.12.068zbMATH Open1200.05192OpenAlexW2017536747MaRDI QIDQ998505FDOQ998505
Authors: Raffaele Mosca
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.068
Recommendations
- Non-ideal oblique shock waves
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
- The stable set polytope of claw-free graphs with large stability number
- Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Other designs, configurations (05B30) Structural characterization of families of graphs (05C75) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Complement reducible graphs
- Modular decomposition and transitive orientation
- On certain polytopes associated with graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the facial structure of set packing polyhedra
- The strong perfect graph theorem
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- Perfect zero–one matrices
- New graph classes of bounded clique-width
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- Stability number of bull- and chair-free graphs revisited
- On variations of \(P_{4}\)-sparse graphs
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Title not available (Why is that?)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Rank-perfect and weakly rank-perfect graphs
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
- Title not available (Why is that?)
Cited In (6)
- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs
- On the b-Stable Set Polytope of Graphs without Bad K4
- The stable set polytope of quasi-line graphs
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
- Non-ideal oblique shock waves
This page was built for publication: The stable set polytope for some extensions of \(P_4\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998505)