Composition of Facets of the Clique Partitioning Polytope

In [1] we have introduced the clique partitioning problem and studied the associated polyhedron, the so-called clique partitioning polytope. In this paper we continue these polyhedral investigations; in particular, we present new classes of facets and methods to construct new facet-defining inequalities from given facet-defining inequalities.