A Note on Coloring Vertex-Transitive Graphs

Electronic Journal Of Combinatorics

Daniel W. Cranston¹ 

关键词: Graph coloring;    Vertex-transitive graphs;    Borodin-Kostochka Conjecture;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We prove bounds on the chromatic number $\chi$ of a vertex-transitive graph in terms of its clique number $\omega$ and maximum degree $\Delta$. We conjecture that every vertex-transitive graph satisfies $\chi \le \max \{\omega, \left\lceil\frac{5\Delta +

【 授权许可】

Others