32 citations · 76 across the 27 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2022
Short and local transformations between ()-colorings
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich +1
Recoloring a graph is about finding a sequence of proper colorings of this graph from an initial coloring to a target coloring . Adding the constraint that each pair of cons…
cs.DM2021★ 1 cited
Classifying grounded intersection graphs via ordered forbidden patterns
Laurent Feuilloley, Michel Habib
It was noted already in the 90s that many classic graph classes, such as interval, chordal, and bipartite graphs, can be characterized by the existence of an ordering of the vertic…