Abstract

In this paper we study the problem of finding a maximum colorful independent set in vertex-colored graphs. Specifically, given a graph with colored vertices, we wish to find an independent set containing the maximum number of colors. Here we aim to give a dichotomy overview on the complexity of this problem. We first show that the problem is NP-hard even for some cases where the maximum independent set problem is easy, such as cographs and P5-free graphs. Next, we provide polynomial-time algorithms for cluster graphs and trees.

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 call

Disclaimer: 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.