Beyond Degree Choosability

Electronic Journal Of Combinatorics

Daniel W. Cranston¹ 

关键词: List coloring;    Choosability;    Degree-choosable;    Alon-Tarsi orientation;    Gallai tree;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $G$ be a connected graph with maximum degree $\Delta$. Brooks' theorem states that $G$ has a $\Delta$-coloring unless $G$ is a complete graph or an odd cycle. A graph $G$ is degree-choosable if $G$ can be properly colored from its lists whenever each

【 授权许可】

Others