Graphs vertex-partitionable into strong cliques

Ademir Hujdurović, Martin Milanič, Bernard Ries

A graph is said to be well-covered if all its maximal independent sets are of the same size. In 1999, Yamashita and Kameda introduced a subclass of well-covered graphs, called loca…