1 paper · 1 filter
Mateusz Kamyczura, Mariusz Meszka, Jakub Przybyło
Let G be a graph with maximum degree Δ and without isolated vertices. An edge colouring c of G is conflict-free if the closed neighbourhood of every edge includes a uniquel…