Carole Muller

collaborators

2 papers

math.CO2020

A note on connected greedy edge colouring

Marthe Bonamy, Carla Groenland, Carole Muller +3

Following a given ordering of the edges of a graph $G$ , the greedy edge colouring procedure assigns to each edge the smallest available colour. The minimum number of colours thus i…

math.CO2019

Unavoidable minors for graphs with large $ℓ_{p}$ -dimension

Samuel Fiorini, Tony Huynh, Gwenaël Joret +1

A metric graph is a pair $(G, d)$ , where $G$ is a graph and $d : E (G) \to R_{\geq 0}$ is a distance function. Let $p \in [1, \infty]$ be fixed. An isometric embedding of the met…

A note on connected greedy edge colouring

Unavoidable minors for graphs with large ℓp​-dimension

Unavoidable minors for graphs with large $ℓ_{p}$ -dimension