3 citations · 3 across the 5 of their papers we have counts for
1 paper · 2 filters
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…