Independent Set Reconfiguration in Cographs-Reference-Cited by-同舟云学术

Independent Set Reconfiguration in Cographs

Published:2014 Issue: Volume: Page:105-116
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Bonsma Paul

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-12340-0_9

Reference27 articles.

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

2. Bonamy, M., Bousquet, N.: Reconfiguring independent sets in cographs, June 2014. arXiv:1406.1433

3. Bonamy, M., Johnson, M., Lignos, I., Patel, V., Paulusma, D.: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. 1–12 (2012)

4. Bonsma, P.: Rerouting shortest paths in planar graphs. In: FSTTCS 2012. vol. 18, LIPIcs, pp. 337–349. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)

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

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

1. Independent-set reconfiguration thresholds of hereditary graph classes;Discrete Applied Mathematics;2018-12

2. Token Sliding on Chordal Graphs;Graph-Theoretic Concepts in Computer Science;2017

3. The complexity of dominating set reconfiguration;Theoretical Computer Science;2016-10

4. Reconfiguration of Vertex Covers in a Graph;IEICE Transactions on Information and Systems;2016

5. A Reconfigurations Analogue of Brooks' Theorem and Its Consequences;Journal of Graph Theory;2015-10-27