19 citations · 24 across the 7 of their papers we have counts for
1 paper · 1 filter
Xiao Zhao, Sheng Chen
Edmonds, Lovász, and Pulleyblank showed that if a matching covered graph has a nontrivial tight cut, then it also has a nontrivial ELP-cut. Carvalho et al. gave a stronger conjectu…