Minimal coloring number for ℤ-colorable links
Kazuhiro Ichihara, Eri Matsudo · Journal of Knot Theory and Its Ramifications · 2017
For a link with zero determinants, a [Formula: see text]-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial [Formula: see text]-coloring a [Formula: see text]-colorable link. The minimal coloring number of a [Formula: see text]-colorable link is the minimal number of colors for non-trivial [Formula: see text]-colorings on diagrams of the link. We give sufficient conditions for non-splittable [Formula: see text]-colorable links to have the least minimal coloring number.