6 papers
Strong majority colorings of graphs
Rafał Kalinowski, Mateusz Kamyczura, Monika Pilśniak +1
Motivated by majority vertex-colorings of graphs and digraphs and majority edge-colorings of graphs, we introduce two concepts of strong majority colorings. A strong majority verte…
Asymptotically Tight Bound for the Conflict-Free Chromatic Index
Mateusz Kamyczura, Jakub Przybyło
The conflict-free chromatic index of a graph is the minimum number of colours in an edge colouring of such that the neighbourhood of every edge contains a colour appearing…
On asymptotically tight bounds for the open conflict-free chromatic indexes of nearly regular graphs
Mateusz Kamyczura, Jakub Przybyło
An edge colouring of a graph is called conflic-free if every non-isolated edge of has a uniquely coloured neighbour in its open edge neighbourhood. The least number of…
On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
Mateusz Kamyczura, Jakub Przybyło
Let be a graph of maximum degree which does not contain isolated vertices. An edge coloring of is called conflict-free if each edge's closed neighborhood includes a…
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…
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…