Sliding token on bipartite permutation graphs
From MaRDI portal
Publication:3459864
Recommendations
Cited in
(19)- On girth and the parameterized complexity of token sliding and token jumping
- Token sliding on split graphs
- On reconfiguration graphs of independent sets under token sliding
- Token sliding on split graphs
- On the complexity of distance-\(d\) independent set reconfiguration
- Independent-set reconfiguration thresholds of hereditary graph classes
- Complexity of token swapping and its variants
- Token sliding on graphs of girth five
- Parameterized complexity of independent set reconfiguration problems
- Introduction to reconfiguration
- Token sliding on graphs of girth five
- On finding short reconfiguration sequences between independent sets
- Sliding tokens on block graphs
- On the complexity of distance-\(d\) independent set reconfiguration
- scientific article; zbMATH DE number 7765402 (Why is no real title available?)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs
- Galactic token sliding
- Computational complexity of puzzles and related topics
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar
This page was built for publication: Sliding token on bipartite permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459864)