On Complete S-Reachable Graphs

DOI10.1080/09720529.2014.932135MaRDI QIDQ5069738zbMATHOpenAlexFDO

Authors Biswajit Deb, Kalpesh Kapoor

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

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

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Feasibility of Motion Planning on Directed Graphs
• Feasibility of motion planning on acyclic and strongly connected directed graphs
• Modelling and solving English peg solitaire
• On \(m\)RJ reachability in trees
• Optimal pebble motion on a tree
• The \((n^ 2-1)\)-puzzle and related relocation problems

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069738)