24 citations · 120 across the 33 of their papers we have counts for
4 papers · 1 filter
On conflict-free proper colourings of graphs without small degree vertices
Mateusz Kamyczura, Jakub Przybyło
A proper vertex colouring of a graph is referred to as conflict-free if in the neighbourhood of every vertex some colour appears exactly once, while it is called -conflict-f…
Mrs. Correct and Majority Colorings
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk +3
A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techn…
On triangle-free list assignments
Jakub Przybyło
We show that Bernshteyn's proof of the breakthrough result of Molloy that triangle-free graphs are choosable from lists of size can be adapted to yield a stronger…
A note on the conflict-free chromatic index
Mateusz Kamyczura, Mariusz Meszka, Jakub Przybyło
Let be a graph with maximum degree and without isolated vertices. An edge colouring of is conflict-free if the closed neighbourhood of every edge includes a uniquel…