Polyhedral characterizations and perfection of line graphs Original Research Article

We give a polyhedral characterization of line graphs that, in some sense, gives a converse to Edmondsʹ matching theorem. We also study perfect,t-perfect andh-perfect line graphs and give polyhedral and structural characterizations. We identify a class ofh-perfect graphs that are neither perfect nort-perfect.