Showing cs.DMShow all
2 papers · 1 filter
cs.DM2020
Recoloring graphs of treewidth 2
Valentin Bartier, Nicolas Bousquet, Marc Heinrich
Two (proper) colorings of a graph are adjacent if they differ on exactly one vertex. Jerrum proved that any -coloring of any d-degenerate graph can be transformed into any…
cs.DM2019
Linear transformations between colorings in chordal graphs
Nicolas Bousquet, Valentin Bartier
Let and be such that . Consider two -colorings of a -degenerate graph . Can we transform one into the other by recoloring one vertex at each step while…