27 citations · 44 across the 18 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 2 cited
-perfect plane triangulations
Yohann Benchetrit, Henning Bruhn
We characterise -perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is -perfect if and only if it is perfect.
math.CO2015★ 2 cited
Ear-decompositions and the complexity of the matching polytope
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…