Laminar Tight Cuts in Matching Covered Graphs

Guantao Chen, Xing Feng, Fuliang Lu +2

An edge cut $C$ of a graph $G$ is {\it tight} if $|C\cap M|=1$ for every perfect matching $M$ of $G$.~Barrier cuts and 2-separation cuts are called {\it ELP-cuts}, which are two i…