Equivalence classes in matching covered graphs

Fuliang Lu, Nishad Kothari, Xing Feng +1

A connected graph $G$, of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph $G$ yields a list of brick…