Abstract
The complexity status of the maximum stable set problem in the class of P 5-free graphs is unknown. In this paper, we first propose a characterization of all connected P 5-free augmenting graphs. We then use this characterization to detect families of subclasses of P 5-free graphs where the maximum stable set problem has a polynomial time solution. These families extend several previously studied classes.
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.
