Token sliding on graphs of girth five
From MaRDI portal
Publication:6182683
DOI10.1007/s00453-023-01181-5OpenAlexW4388001245MaRDI QIDQ6182683
Jihad Hanna, Valentin Bartier, Sebastian Siebertz, Nicolas Bousquet, Amer E. Mouawad
Publication date: 25 January 2024
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-023-01181-5
Cites Work
- Unnamed Item
- A dichotomy theorem for circular colouring reconfiguration
- Complexity of independent set reconfigurability problems
- On the complexity of reconfiguration problems
- Reconfiguration of list edge-colorings in a graph
- Flip distance between two triangulations of a point set is NP-complete
- Reconfiguration in bounded bandwidth and tree-depth
- Token sliding on chordal graphs
- Reconfiguration on sparse graphs
- On girth and the parameterized complexity of token sliding and Token Jumping
- Token sliding on split graphs
- Introduction to reconfiguration
- Connectedness of the graph of vertex-colourings
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- The complexity of change
- Polynomial-Time Algorithm for Sliding Tokens on Trees
- Reconfiguring Independent Sets in Claw-Free Graphs
- Ground State Connectivity of Local Hamiltonians
- Sliding Token on Bipartite Permutation Graphs
- The Complexity of Independent Set Reconfiguration on Bipartite Graphs
- Parameterized Complexity of Independent Set in H-Free Graphs.
- Homomorphism Reconfiguration via Homotopy
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
- On the Parameterized Complexity for Token Jumping on Graphs
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- Galactic token sliding
This page was built for publication: Token sliding on graphs of girth five
