Refine my results

Graphs vertex-partitionable into strong cliques

Hujdurović, Ademir ; Milanič, Martin ; Ries, Bernard

In: Discrete Mathematics, 2018, vol. 341, p. 1392-1405

A clique in a graph is strong if it intersects all maximal independent sets. A graph is localizable if it has a partition of the vertex set into strong cliques. Localizable graphs were introduced by Yamashita and Kameda in 1999 and form a rich class of well- covered graphs that coincides with the class of well-covered graphs within the class of perfect graphs. In this paper, we give several...