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