TY  - GEN 
AU  - Cicerone, S.
AU  - Di Stefano, G.
AU  - Klavžar, S.
AU  - González Yero, Ismael
A4  - Matemáticas
PY  - 2024
SN  - 0195-6698
UR  - http://hdl.handle.net/10498/33585
AB  - The mutual-visibility problem in a graph G asks for the cardinality of a largest set of vertices S⊆V(G) so that for any two vertices x,y∈S there is a shortest x,y-path P so that all internal vertices of P are not in S. This is also said as x,y are...
LA  - eng
PB  - Elsevier
TI  - Mutual-visibility problems on graphs of diameter two
DO  - 10.1016/J.EJC.2024.103995
ER  -