CLAW-FREE t-PERFECT GRAPHS CAN BE RECOGNIZED IN POLYNOMIAL TIME

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