On reconfiguration graphs of independent sets under token sliding
From MaRDI portal
Publication:6115427
DOI10.1007/s00373-023-02644-wzbMath1518.05146arXiv2203.16861OpenAlexW4376618462MaRDI QIDQ6115427
Publication date: 12 July 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.16861
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of independent set reconfigurability problems
- Linear-time algorithm for sliding tokens on trees
- Shortest paths between shortest paths
- Token sliding on chordal graphs
- Token graphs
- Introduction to reconfiguration
- Graph Theory
- The complexity of change
- Reconfiguring Independent Sets in Claw-Free Graphs
- Sliding Token on Bipartite Permutation Graphs
- Split graphs
- Reconfiguring Independent Sets on Interval Graphs