Mutual-visibility sets in Cartesian products of paths and cycles

DOI10.1007/s00025-024-02139-xarXiv2309.15201OpenAlexW4392615454MaRDI QIDQ6196223

Aleksander Vesel, Danilo Korže

Publication date: 14 March 2024

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2309.15201

zbMATH Keywords

Cartesian productmutual-visibility numbermutual-visibility set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

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 mutual visibility in Cartesian products and triangle-free graphs
• Mutual visibility in graphs
• Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
• Variety of mutual-visibility problems in graphs