Asymptotic Lower Bounds on Circular Chromatic Index of Snarks

[摘要] 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

[学科分类] 离散数学和组合数学

[关键词] snark;chromatic index;circular chromatic index;cubic graph