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.CO2023
Vizing's edge-recoloring conjecture holds
Jonathan Narboni
In 1964 Vizing proved that starting from any k-edge-coloring of a graph G one can reach, using only Kempe swaps, a ( + 1)-edge-coloring of G where is the maximum degree of G…