Majority Choosability of Digraphs

[摘要] A majority coloring of a digraph is a coloring of its vertices such that for each vertex $v$, at most half of the out-neighbors of $v$ have the same color as $v$. A digraph $D$ is majority $k$-choosable if for any assignment of lists of colors of size $k$

[学科分类] 离散数学和组合数学

[关键词] Graph theory;Graph coloring;List coloring