Colored pebble motion on graphs

DOI10.1016/j.ejc.2011.09.019zbMath1239.05121OpenAlexW2061247757MaRDI QIDQ412280

Tadashi Sakuma, Tomoki Nakamigawa, Shinya Fujita

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.019

zbMATH Keywords

transitive tuple

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57)

Related Items (5)

Motions of a connected subgraph representing a swarm of robots inside a graph of work stations ⋮ Reconfiguration of connected graph partitions ⋮ Pebble exchange group of graphs ⋮ Introduction to reconfiguration ⋮ Pebble exchange on graphs

Cites Work

• The \((n^ 2-1)\)-puzzle and related relocation problems
• A linear-time algorithm for the feasibility of pebble motion on trees
• Graph puzzles, homotopy, and the alternating group
• A Modern Treatment of the 15 Puzzle
• Colored Pebble Motion on Graphs (Extended Abstract)
• Reconfigurations in Graphs and Grids

This page was built for publication: Colored pebble motion on graphs