Title of article :
On stable cutsets in graphs Original Research Article
Author/Authors :
Andreas Brandst?dt، نويسنده , , Feodor F. Dragan، نويسنده , , Van Bang Le، نويسنده , , Thomas Szymczak، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2000
Abstract :
We answer a question of Corneil and Fonlupt by showing that deciding whether a graph has a stable cutset is NP-complete even for restricted graph classes. Some efficiently solvable cases will be discussed, too.
Keywords :
View the MathML source-completeness , Stable cutsets , Brittle graphs , Hole-free graphs , 1-IN-3 3SAT , Efficient algorithms
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
