3 papers
math.CO2026
On Strong Majority Edge Colourings with Few Colours
Paweł Pękała, Jakub Przybyło
A strong majority edge colouring of a graph is an edge colouring in which, for every edge and every colour , at most half the edges adjacent to receive colour . L…
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 $…
math.CO2023
On generalised majority edge-colourings of graphs
Paweł Pękała, Jakub Przybyło
A -majority -edge-colouring of a graph is a colouring of its edges with colours such that for every colour and each vertex of , at most $\frac{1}…