On the Cartesian product of non well-covered graphs (Q1953503)

Summary: A graph is well-covered if every maximal independent set has the same cardinality, namely the vertex independence number. We answer a question of \textit{J. Topp} and \textit{L. Volkmann} [Ars Comb. 33, 199--215 (1992; Zbl 0776.05090)] and prove that if the Cartesian product of two graphs is well-covered, then at least one of them must be well-covered.