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: 1357; Downloads: 45 Link to full text