4 papers
On-line majority edge-colourings of graphs
Paweł Pękała
A majority edge-colouring of a graph is a colouring of the edges of such that, for every vertex of , at most half of the edges incident with receive the same col…
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…
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 $…
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}…