Equistable graphs are graphs admitting positive weights on vertices such that a subset of
vertices is a maximal stable set if and only if it is of total weight 1. Strongly equistable graphs …

A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong
cliques play an important role in the study of perfect graphs. We study strong cliques in the …

A strong clique in a graph is a clique intersecting every maximal independent set. We study
the computational complexity of six algorithmic decision problems related to strong cliques …

A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is
equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) …

A strong clique in a graph is a clique intersecting every maximal independent set. We study
the computational complexity of six algorithmic decision problems related to strong cliques …

While presenting a combinatorial point of view to the class of equistable graphs, Miklavič
and Milanič pointed out the inclusions among the classes of equistable, general partition …