Mutual visibility in graphs

DOI10.1016/J.AMC.2021.126850OpenAlexW4206068669MaRDI QIDQ2668324

Gabriele Di Stefano

Publication date: 3 March 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitygraph invariantgraph classesmutual visibility

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (13)

Variety of mutual-visibility problems in graphs ⋮ Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ Geodesic packing in graphs ⋮ General position polynomials ⋮ Mutual-visibility sets in Cartesian products of paths and cycles ⋮ On monophonic position sets in graphs ⋮ Mutual-visibility in strong products of graphs via total mutual-visibility ⋮ Total mutual-visibility in Hamming graphs ⋮ Mutual-visibility problems on graphs of diameter two ⋮ Variety of general position problems in graphs ⋮ On the general position number of Mycielskian graphs ⋮ The \(k\)-distance mutual-visibility problem in graphs ⋮ On the mutual visibility in Cartesian products and triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Mutual visibility by luminous robots without collisions
• Optimum algorithm for the mutual visibility problem
• Distance-hereditary graphs
• Geodesic visibility in graphs
• Geodesic convexity in discrete spaces
• Distance-hereditary comparability graphs
• On general position sets in Cartesian products
• Characterization of general position sets and its applications to cographs and bipartite graphs
• The Graph Theory General Position Problem on Some Interconnection Networks
• Graph Classes: A Survey
• A GENERAL POSITION PROBLEM IN GRAPH THEORY
• Characterization of classes of graphs with large general position number
• Reducibility among Combinatorial Problems
• Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
• Mutual visibility by asynchronous robots on infinite grid

This page was built for publication: Mutual visibility in graphs