On 1RJ Moves in Cartesian Product Graphs
O. Oyewumi, Abolape Deborah Akwu · Zenodo (CERN European Organization for Nuclear Research) · 2019
The results of this paper, which is an extension of the work [Motion planning in Cartesian product graphs, Discussiones Mathematicae Graph Theory 34 (2014) 207-221] gives the minimum number of moves required for the motion planning problem in Cartesian product of two graphs each having girth six or more.