Abstract
We answer a question of Brandstadt et al. by showing that deciding whether a line graph with maximum degree 5 has a stable cutset is NP-complete. Conversely, the existence of a stable cutset in a line graph with maximum degree at most 4 can be decided efficiently. The proof of our NP-completeness result is based on a refinement on a result due to Chvatal that recognizing decomposable graphs with maximum degree 4 is an NP-complete problem. Here, a graph is decomposable if its vertices can be colored red and blue in such a way that each color appears on at least one vertex but each vertex v has at most one neighbor having a different color from v. We also discuss some open problems on stable cutsets.
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.
