We answer a question of Corneil and Fonlupt by showing that deciding whethe
r a graph has a stable cutset is NP-complete even fcr restricted graph clas
ses. Some efficiently solvable cases will he discussed, too. (C) 2000 Elsev
ier Science B.V. All rights reserved.