Ga'etan Berthe

collaborators

2 papers

math.CO2025

On Modular Edge Colourings of Graphs

GaÃ©tan Berthe, Marthe Bonamy, FÃ¡bio Botler +5

Given a graph $G$ and an integer $k \geq 2$ , let $I ¨ _{k}^{'} (G)$ denote the minimum number of colours required to colour the edges of $G$ such that, in each colour class, the subgraph in…

math.CO2025

Determining a graph from its reconfiguration graph

Given a graph $G$ and a natural number $k$ , the $k$ -recolouring graph $C_{k} (G)$ is the graph whose vertices are the $k$ -colourings of $G$ and whose edges link pairs of col…