Token Sliding on Chordal Graphs-Reference-Cited by-同舟云学术

Token Sliding on Chordal Graphs

Published:2017 Issue: Volume: Page:127-139
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Bonamy Marthe,Bousquet Nicolas

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-68705-6_10

Reference20 articles.

1. Bonamy, M., Bousquet, N.: Recoloring bounded treewidth graphs. Electron. Notes Discret. Math. 44, 257–262 (2013). (LAGOS 2013)

2. Bonamy, M., Bousquet, N.: Reconfiguring independent sets in cographs. CoRR, abs/1406.1433 (2014)

3. Bonamy, M., Bousquet, N.: Token sliding on chordal graphs. CoRR, abs/1605.00442 (2016)

4. Bonamy, M., Bousquet, N., Feghali, C., Johnson, M.: On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR, abs/1510.06964 (2015)

5. Bonsma, P.: The complexity of rerouting shortest paths. Theoret. Comput. Sci. 510, 1–12 (2013)

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On finding short reconfiguration sequences between independent sets;Journal of Computer and System Sciences;2025-02

2. On the complexity of distance-d independent set reconfiguration;Theoretical Computer Science;2024-09

3. A survey on the parameterized complexity of reconfiguration problems;Computer Science Review;2024-08

4. Finding a Reconfiguration Sequence between Longest Increasing Subsequences;IEICE Transactions on Information and Systems;2024-04-01

5. Feedback vertex set reconfiguration in planar graphs;Theoretical Computer Science;2023-11