Coloring the vertices of a graph with mutual-visibility property

Sandi Klavžar, Dorota Kuziak, Juan Carlos Valenzuela Tripodoro +1

Given a graph $G$, a mutual-visibility coloring of $G$ is introduced as follows. We color two vertices $x,y\in V(G)$ with a same color, if there is a shortest $x,y$-path whose inte…