Bricks that every removable edge is solitary

Jinxin Xue, Jun Ge, Fuliang Lu +1

A brick is a 3-connected graph $G$ such that $G-u-v$ has a perfect matching for any two distinct vertices $u,v\in V(G)$. An edge $e$ in a matching covered graph $G$ is removable if…