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: 1295; Downloads: 41 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: 1392; Downloads: 38 Link to full text