3 problems

Independent mutual-visibility coloring conjecture. For every positive integer $n$,

Mutual-visibility coloring conjecture. The mutual-visibility coloring decision problem is NP-complete.

Let $P_s$ be the path on $s$ vertices and $C_t$ the cycle on $t$ vertices, and let $cmu(G)$ denote the mutual-visibility number of a graph $G$. Mutual-visibility number conjecture.…