Narboni, Jonathan

1. A note on the flip distance between non-crossing spanning trees
   2023/03/14 by Nicolás Bousquet, Valentin Gledel, Bousquet, Nicolas +5 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Search Problems
2. On the 4-color theorem for signed graphs
   2019/06/13 by Kardoš, František, Narboni, Jonathan · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
3. On Vizing's edge colouring question
   2021/07/16 by Bonamy, Marthe, Defrain, Oscar, Klimošová, Tereza +2 · 1 citation
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
4. Vizing's edge-recoloring conjecture holds
   2023/02/24 by Narboni, Jonathan · 1 citation
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics