Asymptotic Lower Bounds on Circular Chromatic Index of Snarks

Electronic Journal Of Combinatorics

Martin Mačaj¹ 

关键词: snark;    chromatic index;    circular chromatic index;    cubic graph;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We prove that the circular chromatic index of a cubic graph $G$ with $2k$ vertices and chromatic index $4$ is at least $3+2/k$. This bound is (asymptotically) optimal for an infinite class of cubic graphs containing bridges. We also show that the constant

【 授权许可】

Others