Compositions of Graphs and Polyhedra II: Stable Sets
From MaRDI portal
Publication:4307045
DOI10.1137/S0895480190182678zbMath0802.05068OpenAlexW1969703328MaRDI QIDQ4307045
Francisco Barahona, Ali Ridha Mahjoub
Publication date: 24 October 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480190182678
inequalitiesstable setminorstable set polytopeseries-parallel graphspolyhedral combinatoricsstable set problemcompact systemcomposition of polyhedra
Related Items (23)
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles ⋮ Fractional and integral colourings ⋮ On decomposability of multilinear sets ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ On the complete set packing and set partitioning polytopes: properties and rank 1 facets ⋮ Separation problems for the stable set polytope ⋮ On claw-free \(t\)-perfect graphs ⋮ 2-clique-bond of stable set polyhedra ⋮ Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus ⋮ Compositions in the bipartite subgraph polytope ⋮ Composition of stable set polyhedra ⋮ New facets for the set packing polytope ⋮ A branch-and-cut algorithm for the maximum cardinality stable set problem ⋮ Unnamed Item ⋮ Extended formulations for vertex cover ⋮ Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time ⋮ A New Facet Generating Procedure for the Stable Set Polytope ⋮ On the facets of the lift-and-project relaxations of graph subdivisions ⋮ A new lifting theorem for vertex packing ⋮ Characterising claw-free t-perfect graphs ⋮ The wheels of the orthogonal Latin squares polytope: classification and valid inequalities ⋮ Stable sets and polynomials ⋮ Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
This page was built for publication: Compositions of Graphs and Polyhedra II: Stable Sets
