A Brooks' Theorem for Triangle-Free Graphs

CoRR（2011）

引用 24|浏览1

暂无评分

摘要

Let G be a triangle-free graph with maximum degree \delta(G). We show that the chromatic number \c{hi}(G) is less than 67(1 + o(1))\delta/ log \delta.

查看译文

关键词

maximum degree,discrete mathematics

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要