Token sliding on graphs of girth five
From MaRDI portal
Publication:6043182
DOI10.1007/978-3-031-15914-5_5arXiv2205.01009OpenAlexW4312837071MaRDI QIDQ6043182
Jihad Hanna, Nicolas Bousquet, Sebastian Siebertz, Valentin Bartier, Amer E. Mouawad
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.01009
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
- Parameterized complexity of independent set in H-free graphs
- 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
- 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
This page was built for publication: Token sliding on graphs of girth five
