1 paper · 1 filter
Bartłomiej Bosek, Aleksander Katan
A majority coloring of an undirected graph is a vertex coloring in which for each vertex there are at least as many bi-chromatic edges containing that vertex as monochromatic ones.…