Mutual-visibility sets in Cartesian products of paths and cycles

Danilo Korže, Aleksander Vesel

For a given graph $G$, the mutual-visibility problem asks for the largest set of vertices $M\subseteq V(G)$ with the property that for any pair of vertices $u,v\in M$ there exist…