The following pages link to Token sliding on split graphs (Q2048202):
Displaying 14 items.
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Invitation to combinatorial reconfiguration (Q2154076) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Swapping labeled tokens on graphs (Q2347003) (← links)
- The Complexity of Independent Set Reconfiguration on Bipartite Graphs (Q4629977) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← links)
- On reconfiguration graphs of independent sets under token sliding (Q6115427) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)
- Algorithmic meta-theorems for combinatorial reconfiguration revisited (Q6623591) (← links)
- On finding short reconfiguration sequences between independent sets (Q6627042) (← links)