Bond Polytope under Vertex- and Edge-sums

Petr Kolman, Hans Raj Tiwary

A cut in a graph $G$ is called a {\em bond} if both parts of the cut induce connected subgraphs in $G$, and the {\em bond polytope} is the convex hull of all bonds. Computing the m…