Computing the largest bond of a graph

Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa +2

A bond of a graph $G$ is an inclusion-wise minimal disconnecting set of $G$, i.e., bonds are cut-sets that determine cuts $[S,V\setminus S]$ of $G$ such that $G[S]$ and $G[V\setmin…