On Complete S-Reachable Graphs

DOI10.1080/09720529.2014.932135zbMath1495.05189OpenAlexW2215587595MaRDI QIDQ5069738

Kalpesh Kapoor, Biswajit Deb

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2014.932135

zbMATH Keywords

reachabilityundirected graphpebble gamemRJ-moves

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

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

Cites Work

• Unnamed Item
• Feasibility of motion planning on acyclic and strongly connected directed graphs
• The \((n^ 2-1)\)-puzzle and related relocation problems
• Optimal pebble motion on a tree
• Modelling and solving English peg solitaire
• Feasibility of Motion Planning on Directed Graphs
• ON mRJ REACHABILITY IN TREES

This page was built for publication: On Complete S-Reachable Graphs