2 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 $…