Hujdurović, Ademir Milanič, Martin Ries, Bernard 2018 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 equivalent formulations of the property of localizability and develop polynomially testable characterizations of localizable graphs within three nonperfect graph classes: triangle-free graphs, C4-free graphs, and line graphs. Furthermore, we use localizable graphs to construct an infinite family of counterexamples to a conjecture due to Zaare-Nahandi about k-partite well-covered graphs having all maximal cliques of size k. application/pdf https://folia.unifr.ch/global/documents/307834 https://folia.unifr.ch/documents/307834/files/vertexpartitionable_rero.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.disc.2018.02.013 info:eu-repo/semantics/openAccess License undefined Discrete Mathematics. - 2018, vol. 341, p. 1392-1405 Strong clique Clique cover Well-covered graph Localizable graph Line graph Characterization info:eu-repo/classification/udc/004 Graphs vertex-partitionable into strong cliques http://purl.org/coar/resource_type/c_6501