2 papers
cs.CG2023
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…
math.CO2021
Improved square coloring of planar graphs
Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer +1
Square coloring is a variant of graph coloring where vertices within distance two must receive different colors. When considering planar graphs, the most famous conjecture (Wegner,…