Title of article
Polyhedral characterizations and perfection of line graphs Original Research Article
Author/Authors
Dasong Cao، نويسنده , , George L. Nemhauser، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
14
From page
141
To page
154
Abstract
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.
Journal title
Discrete Applied Mathematics
Serial Year
1998
Journal title
Discrete Applied Mathematics
Record number
884691
Link To Document