Sciweavers

WG
2005
Springer
14 years 5 months ago
On Stable Cutsets in Claw-Free Graphs and Planar Graphs
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
Van Bang Le, Raffaele Mosca, Haiko Müller