Claw-free t-perfect graphs can be recognised in polynomial time

Henning Bruhn, Oliver Schaudt

A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a gi…