Vertex-partitions of 2-edge-colored graphs

Jørgen Bang-Jensen, Francois Pirot, Anders Yeo

A {\bf $\mathbf{k}$-majority coloring} of a digraph $D=(V,A)$ is a coloring of $V$ with $k$ colors so that each vertex $v\in V$ has at least as many out-neighbours of color differe…