A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Graphs vertex-partitionable into strong cliques
[article]
2017
arXiv
pre-print
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 localizable graphs and defined as graphs having a partition of the vertex set into strong cliques, where a clique in a graph is strong if it intersects all maximal independent sets. Yamashita and Kameda observed that all well-covered trees are localizable, pointed out that the converse inclusion fails in general, and
arXiv:1609.06961v2
fatcat:nscvt2syzbcrhmuwg7oed6pvuu