Integer and combinatorial optimization
Integer and combinatorial optimization
Polyhedral properties of clutter amalgam
SIAM Journal on Discrete Mathematics
Compositions of Graphs and Polyhedra II: Stable Sets
SIAM Journal on Discrete Mathematics
Polyhedral consequences of the amalgam operation
Discrete Mathematics
Mathematical Programming: Series A and B
Wheel inequalities for stable set polytopes
Mathematical Programming: Series A and B
Clique family inequalities for the stable set polytope of quasi-line graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
Claw-free graphs. V. Global structure
Journal of Combinatorial Theory Series B
Gear Composition of Stable Set Polytopes and G-Perfection
Mathematics of Operations Research
Gear composition and the stable set polytope
Operations Research Letters
Composition of stable set polyhedra
Operations Research Letters
| Hi-index | 0.04 |
The 2-bond is a generalization of the 2-join where the subsets of nodes that are connected on each shore of the partition are not necessarily disjoint. If all the subsets are cliques we say that the 2-bond is a 2-clique-bond. The 2-clique-bond composition builds a graph G admitting a 2-clique-bond starting from two graphs G"1 and G"2. We prove that a linear description of the stable set polytope of G is obtained by properly composing the linear inequalities describing the stable set polytopes of G"1, G"2 and two other related graphs. We explain how to apply iteratively the 2-clique-bond composition to provide the complete linear description of the stable set polytope of new classes of graphs.