A characterization of biconnected graphs reachable by robots jumping over m obstacles
References (7)
Graph puzzles, homotopy, and the alternating group
Journal Of Combinatorial Theory (B)
(1974)A modern treatment of the 15 puzzle
American Mathematical Monthly
(1999)- et al.
On mRJ reachability in trees
Discrete Mathematics, Algorithms and Applications
(2012)
There are more references available in the full text version of this article.
Cited by (0)
- 1
The author thanks the anonymous reviewers for their constructive comments, which helped a lot to improve this manuscript.
© 2017 Elsevier B.V. All rights reserved.