Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: all
Choose Problem

Authors: Marthe Bonamy
Choose Author


[9]
Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel and Daniël Paulusma,
On the diameter of reconfiguration graphs for vertex colourings,
Proceedings of the 6th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011), Electronic Notes in Discrete Mathematics 38, pp. 161-166, 2011. (LINK)

[18]
Marthe Bonamy and Nicolas Bousquet,
Recoloring bounded treewidth graphs,
Proceedings of the 7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2013), Electronic Notes in Discrete Mathematics 44, pp. 257-262, 2013. (LINK)

[21]
Marthe Bonamy and Nicolas Bousquet,
Reconfiguring independent sets in cographs,
arXiv 1406.1433, 2014. (LINK)

[22]
Marthe Bonamy and Nicolas Bousquet,
Recoloring graphs via tree decompositions,
arXiv 1403.6386, 2014. (LINK)

[23]
Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel and Daniël Paulusma,
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs,
Journal of Combinatorial Optimization 27(1), pp. 132-143, 2014. (LINK)

[32]
Marthe Bonamy, Nicolas Bousquet, Carl Feghali and Matthew Johnson,
On a conjecture of Mohar concerning Kempe equivalence of regular graphs,
arXiv 1510.06964, 2015. (LINK)

[69]
Marthe Bonamy and Nicolas Bousquet,
Token sliding on chordal graphs,
Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Lecture Notes in Computer Science, to appear.