$b$-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks

Fuliang Lu, Xing Feng, Yan Wang

A {\em brick} is a non-bipartite matching covered graph without non-trivial tight cuts. Bricks are building blocks of matching covered graphs. We say that an edge $e$ in a brick $G…