Abstract
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 for K4-free graphs. Here we show how to decide this problem in polynomial time for (claw, K4)-free graphs and for a claw-free graph of maximum degree at most four. As a by-product we prove that the stable cutset problem is polynomially solvable for claw-free planar graphs, and for planar line graphs. now, the computational complexity of the stable cutset problem restricted to claw-free graphs and claw-free planar graphs is known for all bounds on the maximum degree. Moreover, we prove that the stable cutset problem remains nP-complete for K4-free planar graphs of maximum degree five.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
