5 citations · 5 across the 2 of their papers we have counts for
4 papers
Minimal coloring numbers on minimal diagrams of torus links
Kazuhiro Ichihara, Katsumi Ishikawa, Eri Matsudo
We determine the minimal number of colors for non-trivial -colorings on the standard minimal diagrams of -colorable torus links. Also included are complete…
Minimal coloring number on minimal diagrams for -colorable links
Kazuhiro Ichihara, Eri Matsudo
It was shown that any -colorable link has a diagram which admits a non-trivial -coloring with at most four colors. In this paper, we consider minimal number…
Minimal coloring number for Z-colorable links
Kazuhiro Ichihara, Eri Matsudo
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…
A lower bound on minimal number of colors for links
Kazuhiro Ichihara, Eri Matsudo
We show that the minimal number of colors for all effective -colorings of a link with non-zero determinant is at least .