Removing colors 2k, 2k − 1, and k

DOI10.1142/S0218216519400133zbMath1439.57021arXiv1308.5278OpenAlexW2982508134MaRDI QIDQ5218909

No author found.

Publication date: 6 March 2020

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.5278

zbMATH Keywords

knots and linksminimum number of colorsFox coloringsremoving colors

Mathematics Subject Classification ID

Knot theory (57K10)

Related Items (2)

The minimum number of coloring of knots ⋮ The palette numbers of torus knots

Cites Work

• Unnamed Item
• Unnamed Item
• The delunification process and minimal diagrams
• The minimum number of Fox colors modulo 13 is 5
• 5-colored knot diagram with four colors
• Knots and graphs. I: Arc graphs and colorings
• On the minimum number of colors for knots
• 11-Colored knot diagram with five colors
• Any 11-Colorable knot can be colored with at most six colors
• QUANDLES AT FINITE TEMPERATURES I
• ON THE MAXIMUM NUMBER OF COLORS FOR LINKS
• Any 7-colorable knot can be colored by four colors

This page was built for publication: Removing colors 2k, 2k − 1, and k