Strong cliques in diamond-free graphs.

2020-10-26 10:00 — 11:00 ZOOM (See link below) Peter Muršič (UP FAMNIT) Strong cliques in diamond-free 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…



