Sequentially Swapping Tokens: Further on Graph Classes

This publication has 14 references indexed in Scilit:

• The complexity of change
  2013
• Hamiltonian circuits in chordal bipartite graphs
  Discrete Mathematics, 1996
• The (n2−1)-puzzle and related relocation problems
  Journal of Symbolic Computation, 1990
• The NP-completeness of steiner tree and dominating set for chordal bipartite graphs
  Theoretical Computer Science, 1987
• Steiner trees, connected domination and strongly chordal graphs
  Networks, 1985
• Hamilton Paths in Grid Graphs
  SIAM Journal on Computing, 1982
• Fast Pattern Matching in Strings
  SIAM Journal on Computing, 1977
• The Rectilinear Steiner Tree Problem is $NP$-Complete
  SIAM Journal on Applied Mathematics, 1977
• Algorithm 447: efficient algorithms for graph manipulation
  Communications of the ACM, 1973
• Notes on the "15" Puzzle
  American Journal of Mathematics, 1879