4 papers
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 $…
Words Avoiding Tangrams
Michał Dębski, Jarosław Grytczuk, Bartłomiej Pawlik +2
A \emph{tangram} is a word in which every letter occurs an even number of times. Such word can be cut into parts that can be arranged into two identical words. The minimum number o…
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}…
Equitable neighbour-sum-distinguishing edge and total colourings
Olivier Baudon, Monika Pilsniak, Jakub Przybylo +3
With any (not necessarily proper) edge -colouring of a graph ,one can associate a vertex colouring given by $σ\_γ(v)=\sum\_{e\ni v…