The well-covered dimension of products of graphs

We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found,provided that G has a largest greedy independent decomposition of length c < n.