Log In Sign Up

On the Bond Polytope

by   Markus Chimani, et al.

Given a graph G=(V,E), the maximum bond problem searches for a maximum cut δ(S) ⊆ E with S ⊆ V such that G[S] and G[V∖ S] are connected. This problem is closely related to the well-known maximum cut problem and known under a variety of names such as largest bond, maximum minimal cut and maximum connected (sides) cut. The bond polytope is the convex hull of all incidence vectors of bonds. Similar to the connection of the corresponding optimization problems, the bond polytope is closely related to the cut polytope. While cut polytopes have been intensively studied, there are no results on bond polytopes. We start a structural study of the latter. We investigate the relation between cut- and bond polytopes and study the effect of graph modifications on bond polytopes and their facets. Moreover, we study facet-defining inequalities arising from edges and cycles for bond polytopes. In particular, these yield a complete linear description of bond polytopes of cycles and 3-connected planar (K_5-e)-minor free graphs. Moreover we present a reduction of the maximum bond problem on arbitrary graphs to the maximum bond problem on 3-connected graphs. This yields a linear time algorithm for maximum bond on (K_5-e)-minor free graphs.


page 1

page 2

page 3

page 4


Cut Polytopes of Minor-free Graphs

The cut polytope of a graph G is the convex hull of the indicator vector...

On the Dominant of the Multicut Polytope

Given a graph G=(V,E) and a set S ⊆V2 of terminal pairs, the minimum mul...

Computing the Largest Bond and the Maximum Connected Cut of a Graph

The cut-set ∂(S) of a graph G=(V,E) is the set of edges that have one en...

On Happy Colorings, Cuts, and Structural Parameterizations

We study the Maximum Happy Vertices and Maximum Happy Edges problems. Th...

Disconnected Cuts in Claw-free Graphs

A disconnected cut of a connected graph is a vertex cut that itself also...

Computing the largest bond of a graph

A bond of a graph G is an inclusion-wise minimal disconnecting set of G,...

Universally-Optimal Distributed Exact Min-Cut

We present a universally-optimal distributed algorithm for the exact wei...