Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
33
click to vote
WG
2005
Springer
94
views
Theoretical Computer Science
»
more
WG 2005
»
On Stable Cutsets in Claw-Free Graphs and Planar Graphs
14 years 5 months ago
Download
www.informatik.uni-rostock.de
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
claim paper
Read More »