On essentially 4-edge-connected cubic bricks

Nishad Kothari, Marcelo H. de Carvalho, Cláudio L. Lucchesi +1

Lovász (1987) proved that every matching covered graph $G$ may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let $b(G)$ denote the number o…