A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
2 -clique-bond of stable set polyhedra
2013
Discrete Applied Mathematics
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. We consider a graph G obtained as the 2-clique-bond of two graphs G 1 and G 2 and we study the polyhedral properties of the stable set polytope associated with this graph. In particular, we prove that a linear description of the stable set polytope of G is obtained by
doi:10.1016/j.dam.2013.02.022
fatcat:asiiqsjgv5hh3m6z6ypligan6q