Keywords: distance-k dominating set, distance-k edge dominating set, distance-k vertex cover, distance k-edge cover, H-free graph, polynomial-time algorithm, NP-complete problem, dichotomy theoremPublished in RUP: 18.10.2021; Views: 1920; Downloads: 18 Link to full text
Keywords: distance-k vertex cover, H-free graph, np-completeness, polynomial-time algorithm, dichotomyPublished in RUP: 16.07.2021; Views: 1466; Downloads: 30 Link to full text