Mobile mutual-visibility sets in graphs
From MaRDI portal
Cites work
- A general position problem in graph theory
- General position polynomials
- General position sets in two families of Cartesian product graphs
- Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products
- Lower (total) mutual-visibility number in graphs
- Mutual visibility by luminous robots without collisions
- Mutual visibility in graphs
- Mutual-visibility in distance-hereditary graphs: a linear-time algorithm
- Mutual-visibility in strong products of graphs via total mutual-visibility
- Mutual-visibility problems on graphs of diameter two
- Mutual-visibility sets in Cartesian products of paths and cycles
- On the extremal combinatorics of the Hamming space
- On the mutual visibility in Cartesian products and triangle-free graphs
- The k-distance mutual-visibility problem in graphs
- The general position number of Cartesian products involving a factor with small diameter
- The general position number of integer lattices
- The graph theory general position problem on some interconnection networks
- Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
- Total mutual-visibility in Hamming graphs
- TRAVERSING A GRAPH IN GENERAL POSITION
- Variety of mutual-visibility problems in graphs
This page was built for publication: Mobile mutual-visibility sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6870234)
