V. Chvatal conjectured in 1985 that a minimal imperfect graph G cannot have
a skew cutset (i.e., a cutset S decomposable into disjoint sets A and B jo
ined by all possible edges). We prove here the conjecture in the particular
case where at least one of A and B is a stable set. (C) 2001 Academic Pres
s.