3 papers
math.CO2026
Asymptotically Tight Bound for the Conflict-Free Chromatic Index
Mateusz Kamyczura, Jakub Przybyło
The conflict-free chromatic index of a graph is the minimum number of colours in an edge colouring of such that the neighbourhood of every edge contains a colour appearing…
math.CO2026
On asymptotically tight bounds for the open conflict-free chromatic indexes of nearly regular graphs
Mateusz Kamyczura, Jakub Przybyło
An edge colouring of a graph is called conflic-free if every non-isolated edge of has a uniquely coloured neighbour in its open edge neighbourhood. The least number of…
math.CO2025
On list extensions of the majority edge colourings
Paweł Pękała, Jakub Przybyło
We investigate possible list extensions of generalised majority edge colourings of graphs and provide several results concerning these. Given a graph , a list assignment $…