37 citations · 64 across the 8 of their papers we have counts for
1 paper · 1 filter
Yohann Benchetrit, András Sebő
The complexity of the matching polytope of graphs may be measured with the maximum length β of a starting sequence of odd ears in an ear-decomposition. Indeed, a theorem of Edmon…