3 papers
math.CO2026
Inversion diameter and 2-edge-colored homomorphisms
Carmen Arana, Thomas Bellitto, Hector Buffière +3
In an oriented graph, the inversion of a subset of vertices X is the operation reversing the direction of every arc with both endpoints in X. Given a graph G, the inversion distanc…
math.CO2025
Chromatic discrepancy of locally -colourable graphs
Timothée Corsini, Lucas Picasarri-Arrieta, Théo Pierron +2
The chromatic discrepancy of a graph , denoted , is the least over all proper colourings of of the greatest difference between the number of colours …
math.CO2025
Determining a graph from its reconfiguration graph
Gaétan Berthe, Caroline Brosse, Brian Hearn +3
Given a graph and a natural number , the -recolouring graph is the graph whose vertices are the -colourings of and whose edges link pairs of col…