24 citations · 120 across the 33 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020★ 1 cited
Conflict-free chromatic number vs conflict-free chromatic index
Michał Dębski, Jakub Przybyło
A vertex coloring of a given graph is conflict-free if the closed neighborhood of every vertex contains a unique color (i.e. a color appearing only once in the neighborhood). T…
math.CO2020
The 1-2-3 Conjecture holds for graphs with large enough minimum degree
Jakub Przybyło
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can…