Abstract
We consider the problem of reducing the (semi)total domination number of a graph by one by contracting edges. It is known that this can always be done with at most three edge contractions and that deciding whether one edge contraction suffices is an NP-hard problem. We show that for every fixed k∈{2,3}, deciding whether exactly k edge contractions are necessary is NP-hard and further provide for k=2 complete complexity dichotomies on monogenic graph 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.
