1 paper · 2 filters
Henning Bruhn, Elke Fuchs
A graph is called t-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise P5-free t-perfect graphs in term…