Variety of mutual-visibility problems in graphs
From MaRDI portal
Publication:6049930
DOI10.1016/j.tcs.2023.114096arXiv2304.00864OpenAlexW4385605041MaRDI QIDQ6049930
Lara Drožđek, Gabriele Di Stefano, Sandi Klavžar, Ismael González Yero, Jaka Hedžet, Serafino Cicerone
Publication date: 18 September 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.00864
computational complexitygrid graphtorus graphdual mutual-visibility numbermutual-visibilityouter mutual-visibilitytotal mutual-visibility
Related Items (2)
Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ Mutual-visibility sets in Cartesian products of paths and cycles
Cites Work
- Mutual visibility by luminous robots without collisions
- Optimum algorithm for the mutual visibility problem
- On general position sets in Cartesian products
- On the general position number of two classes of graphs
- On the mutual visibility in Cartesian products and triangle-free graphs
- The general position achievement game played on graphs
- The general position number of Cartesian products involving a factor with small diameter
- Mutual visibility in graphs
- On the general position problem on Kneser graphs
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- Some position problems for graphs
This page was built for publication: Variety of mutual-visibility problems in graphs