1 paper
Isaac Birnbaum, Megan Kuneli, Robyn McDonald +2
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-co…