@techreport{oai:ipsj.ixsq.nii.ac.jp:00157890,
 author = {Duc, A. Hoang and Ryuhei, Uehara and Duc, A. Hoang and Ryuhei, Uehara},
 issue = {5},
 month = {Feb},
 note = {Given two independent sets I and J (having the same cardinality) of a graph G, and imagine that a token (coin) is placed on each vertex in I. Then, the sliding token problem asks if one could transforms I to J using a sequence of elementary steps, where each step requires sliding a token from one vertex to one of its neighbors such that the resulting set of vertices where tokens are placed still remains independent. Interestingly, on some graph classes such as trees, bipartite graphs, unicyclic graphs, etc., sometimes the tokens are required to make “detours” in order not to violate the independence property. This makes the sliding token problem more complicated and challenged. In this paper, based on the idea of Demaine et al. [4], we present a polynomial-time algorithm for SOLVING SLIDING TOKEN on unicyclic graphs., Given two independent sets I and J (having the same cardinality) of a graph G, and imagine that a token (coin) is placed on each vertex in I. Then, the sliding token problem asks if one could transforms I to J using a sequence of elementary steps, where each step requires sliding a token from one vertex to one of its neighbors such that the resulting set of vertices where tokens are placed still remains independent. Interestingly, on some graph classes such as trees, bipartite graphs, unicyclic graphs, etc., sometimes the tokens are required to make “detours” in order not to violate the independence property. This makes the sliding token problem more complicated and challenged. In this paper, based on the idea of Demaine et al. [4], we present a polynomial-time algorithm for SOLVING SLIDING TOKEN on unicyclic graphs.},
 title = {Sliding tokens on unicyclic graphs},
 year = {2016}
}