On Lehman's Width-Length Characterization

摘要

We discuss certain results of A.Lehman concerning the structure of "minor-minimal clutters without the width-length property". These results are analogous to the well-known theorems of Lovasz and Padberg asserting that all minimal imperfect graphs are partitionable.