Majority Choosability of Digraphs

Electronic Journal Of Combinatorics

Marcin Anholcer¹ 

关键词: Graph theory;    Graph coloring;    List coloring;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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$

【 授权许可】

Others