3 citations · 4 across the 13 of their papers we have counts for
4 papers · 1 filter
Reconfiguration of plane trees in convex geometric graphs
Nicolas Bousquet, Lucas De Meyer, Théo Pierron +1
A non-crossing spanning tree of a set of points in the plane is a spanning tree whose edges pairwise do not cross. Avis and Fukuda in 1996 proved that there always exists a flip se…
A note on the flip distance between non-crossing spanning trees
Nicolas Bousquet, Valentin Gledel, Jonathan Narboni +1
We consider spanning trees of points in convex position whose edges are pairwise non-crossing. Applying a flip to such a tree consists in adding an edge and removing another so…
Extremal Independent Set Reconfiguration
Nicolas Bousquet, Bastien Durain, Théo Pierron +1
The independent set reconfiguration problem asks whether one can transform one given independent set of a graph into another, by changing vertices one by one in such a way the inte…
A note on highly connected -minor free graphs
Nicolas Bousquet, Théo Pierron, Alexandra Wesolek
We show that every -connected -minor free graph with minimum degree at least has maximum degree at most . As a consequence, we show that every 3-connected…