The stable set polytope for some extensions of \(P_4\)-free graphs

DOI10.1016/j.disc.2007.12.068zbMath1200.05192OpenAlexW2017536747MaRDI QIDQ998505

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

zbMATH Keywords

stable set polytopemodular decomposition\(P_{4}\)-free graphs

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New graph classes of bounded clique-width
• The strong perfect graph theorem
• Structure and stability number of chair-, co-P- and gem-free graphs revisited
• Complement reducible graphs
• Modular decomposition and transitive orientation
• Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
• On certain polytopes associated with graphs
• Rank-perfect and weakly rank-perfect graphs
• On variations of \(P_{4}\)-sparse graphs
• Stability number of bull- and chair-free graphs revisited
• Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
• Graph Classes: A Survey
• Perfect zero–one matrices
• On the facial structure of set packing polyhedra
• GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH

This page was built for publication: The stable set polytope for some extensions of \(P_4\)-free graphs