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: 1892; 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: 1388; Downloads: 30 Link to full text
Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, strongly perfect graph, CIS graph, NP-hard problem, polynomial-time algorithm, Erdős-Hajnal propertyPublished in RUP: 17.12.2020; Views: 1311; Downloads: 42 Link to full text
Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, CIS graph, NP-hard problem, linear-time algorithm, Erdős-Hajnal propertyPublished in RUP: 10.11.2020; Views: 1401; Downloads: 38 Link to full text