Ključne besede: 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 theoremObjavljeno v RUP: 18.10.2021; Ogledov: 1888; Prenosov: 18 Povezava na celotno besedilo
Ključne besede: distance-k vertex cover, H-free graph, np-completeness, polynomial-time algorithm, dichotomyObjavljeno v RUP: 16.07.2021; Ogledov: 1387; Prenosov: 30 Povezava na celotno besedilo
Ključne besede: 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 propertyObjavljeno v RUP: 17.12.2020; Ogledov: 1310; Prenosov: 42 Povezava na celotno besedilo
Ključne besede: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, CIS graph, NP-hard problem, linear-time algorithm, Erdős-Hajnal propertyObjavljeno v RUP: 10.11.2020; Ogledov: 1401; Prenosov: 38 Povezava na celotno besedilo