Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: Vertex coloring
Choose Problem

Authors: Nicolas Bousquet
Choose Author


[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)

[22]
Marthe Bonamy and Nicolas Bousquet,
Recoloring graphs via tree decompositions,
arXiv 1403.6386, 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)

[47]
Nicolas Bousquet and Guillem Perarnau,
Fast recoloring of sparse graphs,
European Journal of Combinatorics 52(Part A), pp. 1-11, 2016. (LINK)