27 citations · 44 across the 18 of their papers we have counts for
Showing math.COShow all
3 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…
math.CO2014★ 1 cited
Integer round-up property for the chromatic number of some h-perfect graphs
Yohann Benchetrit
A graph is h-perfect if its stable set polytope can be completely described by non-negativity, clique and odd-hole constraints. It is t-perfect if it furthermore has no clique of s…