Abstract
We consider the problem of deciding whether a k-colored graph can be completed to have a given property. We establish that, when k is not fixed, the completion problem for circular-arc graphs, even unit or proper circular-arc graphs, is NP-complete. When k is fixed, in the case of completion to circular-arc graphs and Helly circular-arc graphs, we fully classify the complexities of the problems. We also show that deciding whether a 3-colored graph can be completed to be strongly chordal can be done in O(n 2) time. As a corollary of our results, the sandwich problem for Helly circular-arc graphs is NP-complete.
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.
