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…