@misc{10498/39075,
year = {2026},
month = {10},
url = {http://hdl.handle.net/10498/39075},
abstract = {The general position problem asks for large sets of vertices such that no three vertices of the set lie on a common shortest path. Recently a dynamic version of this problem was defined, called the mobile general position problem , in which a collection of robots must visit all the vertices of the graph whilst remaining in general position. In this paper we investigate this problem in the context of Cartesian products, corona products and joins, giving upper and lower bounds for general graphs and exact values for families including grids, cylinders, Hamming graphs and prisms of trees.},
publisher = {Elsevier},
keywords = {General position set},
keywords = {Mobile general position set},
keywords = {Mobile general position number},
keywords = {Robot navigation},
keywords = {Cartesian product graph},
title = {Moving through Cartesian products, coronas and joins in general position},
doi = {10.1016/J.DAM.2025.10.041},
author = {Klavžar, Sandi and Krishnakumar, Aditi and Kuziak, Dorota and Shallcross, Ethan and Tuite, James and González Yero, Ismael},
}