TY  - GEN 
AU  - Cicerone, Serafino
AU  - Di Stefano, Gabriele
AU  - Drožđek, Lara
AU  - Hedžet, Jaka
AU  - Klavžar, Sandi
AU  - González Yero, Ismael
A4  - Matemáticas
PY  - 2023
SN  - 0304-3975
UR  - http://hdl.handle.net/10498/32540
AB  - If X is a subset of vertices of a graph G, then vertices u and v are X-visible if there exists a shortest u,v-path P such that V(P)∩X⊆{u,v}. If each two vertices from X are X-visible, then X is a mutual-visibility set. The mutual-visibility number of...
LA  - eng
PB  - Elsevier
KW  - Computational complexity
KW  - Dual mutual-visibility number
KW  - Grid graph
KW  - Mutual-visibility
KW  - Outer mutual-visibility
KW  - Torus graph
KW  - Total mutual-visibility
TI  - Variety of mutual-visibility problems in graphs
DO  - 10.1016/J.TCS.2023.114096
ER  -