A lower bound on minimal number of colors for links
From MaRDI portal
Publication:2971301
zbMath1368.57003arXiv1507.04088MaRDI QIDQ2971301
Eri Matsudo, Kazuhiro Ichihara
Publication date: 4 April 2017
Full work available at URL: https://arxiv.org/abs/1507.04088
Related Items (7)
Minimal sufficient sets of colors and minimum number of colors ⋮ An improvement of the lower bound for the minimum number of link colorings by quandles ⋮ The palette numbers of torus knots ⋮ Minimal coloring number for ℤ-colorable links ⋮ The 6- and 8-palette numbers of links ⋮ 11-Colored knot diagram with five colors ⋮ The palette numbers of 2-bridge knots
This page was built for publication: A lower bound on minimal number of colors for links
