Sequentially swapping colored tokens on graphs

Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno

Research output: Contribution to journalArticle

1 Citation (Scopus)


We consider a puzzle consisting of colored tokens on an n-vertex graph, where each token has a distinct starting vertex and a set of allowable target vertices for it to reach, and the only allowed transformation is to "sequentially" move the chosen token along a path of the graph by swapping it with other tokens on the path.

Original languageEnglish
Pages (from-to)3-27
Number of pages25
JournalJournal of Graph Algorithms and Applications
Issue number1
Publication statusPublished - Jan 1 2019

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science Applications
  • Geometry and Topology
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Sequentially swapping colored tokens on graphs'. Together they form a unique fingerprint.

  • Cite this

    Yamanaka, K., Demaine, E. D., Horiyama, T., Kawamura, A., Nakano, S. I., Okamoto, Y., Saitoh, T., Suzuki, A., Uehara, R., & Uno, T. (2019). Sequentially swapping colored tokens on graphs. Journal of Graph Algorithms and Applications, 23(1), 3-27.