Token sliding on split graphs
From MaRDI portal
Recommendations
Cites work
- Complexity of independent set reconfigurability problems
- Fixed-parameter tractability of token jumping on planar graphs
- Games, puzzles, and computation
- Introduction to reconfiguration
- Linear-time algorithm for sliding tokens on trees
- On the complexity of reconfiguration problems
- On the Parameterized Complexity for Token Jumping on Graphs
- Parameterized algorithms
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration of Colorable Sets in Classes of Perfect Graphs
- Reconfiguring independent sets in claw-free graphs
- Sliding token on bipartite permutation graphs
- Sliding tokens on a cactus
- The complexity of change
- The complexity of independent set reconfiguration on bipartite graphs
- Token jumping in minor-closed classes
- Token sliding on chordal graphs
Cited in
(11)- Token sliding on split graphs
- Swapping labeled tokens on graphs
- Reconfiguration of colorable sets in classes of perfect graphs
- The complexity of independent set reconfiguration on bipartite graphs
- The complexity of independent set reconfiguration on bipartite graphs
- Linear-time algorithm for sliding tokens on trees
- Reconfiguration of Spanning Trees with Many or Few Leaves
- scientific article; zbMATH DE number 7765402 (Why is no real title available?)
- Galactic token sliding
- On reconfiguration graphs of independent sets under token sliding
- Galactic token sliding
This page was built for publication: Token sliding on split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090459)
