Minimal coloring number for Z-colorable links
Geometric Topology
2016-05-27 v1
Abstract
For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is the minimal number of colors for non-trivial Z-colorings on diagrams of the link. We give sufficient conditions for non-splittable Z-colorable links to have the least minimal coloring number.
Keywords
Cite
@article{arxiv.1605.08127,
title = {Minimal coloring number for Z-colorable links},
author = {Kazuhiro Ichihara and Eri Matsudo},
journal= {arXiv preprint arXiv:1605.08127},
year = {2016}
}