Sequentially Swapping Colored Tokens on Graphs

DOI DOI IR Web Site Web Site 2 Citations 8 References

Search this article

Description

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.

identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/16203

Journal

Citations (2)*help

See more

References(8)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top