Mutual-visibility problems on graphs of diameter two
From MaRDI portal
Publication:6568863
DOI10.1016/j.ejc.2024.103995zbMATH Open1543.05083MaRDI QIDQ6568863
Gabriele Di Stefano, Sandi Klavžar, Serafino Cicerone, Ismael González Yero
Publication date: 8 July 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mutual visibility by luminous robots without collisions
- Optimum algorithm for the mutual visibility problem
- Complement reducible graphs
- On general position sets in Cartesian products
- On the general position number of two classes of graphs
- The edge general position problem
- 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
- A characterization of the non-trivial diameter two graphs of minimum size
- Mutual visibility in graphs
- Über ein Problem von K. Zarankiewicz
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- On the general position problem on Kneser graphs
- On Graphs that do not Contain a Thomsen Graph
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- General position sets in two families of Cartesian product graphs
- Variety of mutual-visibility problems in graphs
- TRAVERSING A GRAPH IN GENERAL POSITION
- Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
- Edge general position sets in Fibonacci and Lucas cubes
- Lower (total) mutual-visibility number in graphs
Related Items (1)
This page was built for publication: Mutual-visibility problems on graphs of diameter two
