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: 1292; Prenosov: 41 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: 1392; Prenosov: 38 Povezava na celotno besedilo
Ključne besede: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graphObjavljeno v RUP: 03.09.2019; Ogledov: 1737; Prenosov: 16 Povezava na celotno besedilo
Ključne besede: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graphObjavljeno v RUP: 20.08.2019; Ogledov: 2054; Prenosov: 156 Povezava na celotno besedilo