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: 1297; 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
Keywords: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graphPublished in RUP: 03.09.2019; Views: 1737; Downloads: 16 Link to full text
Keywords: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graphPublished in RUP: 20.08.2019; Views: 2054; Downloads: 156 Link to full text