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: 1718; Downloads: 18 Link to full text
Keywords: minimum maximal matching, equimatchable graph, edge dominating set, Gallai-Edmonds decomposition, parameterized complexityPublished in RUP: 29.01.2018; Views: 2132; Downloads: 146 Link to full text