A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles

DOI10.1016/j.endm.2017.11.012zbMath1383.05178OpenAlexW2774008897MaRDI QIDQ2413355

Biswajit Deb

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.11.012

zbMATH Keywords

bi-connected graphs\( mRJ\)-moves\( mRJ\)-reachability

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Graph puzzles, homotopy, and the alternating group
• A Modern Treatment of the 15 Puzzle
• Preemptive Ensemble Motion Planning on a Tree
• ON mRJ REACHABILITY IN TREES
• On Complete S-Reachable Graphs

This page was built for publication: A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles