THE TENEVA GAME

DOI10.1142/S0218216512501258zbMath1279.57010arXiv1204.5011OpenAlexW2963758767MaRDI QIDQ4906458

Louis H. Kauffman, Pedro Lopes

Publication date: 11 February 2013

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

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

zbMATH Keywords

knotstorus knotscoloringsminimum number of colorsdiagramsTeneva transformations

Mathematics Subject Classification ID

Related Items (5)

Minimal sufficient sets of colors and minimum number of colors ⋮ The palette numbers of torus knots ⋮ The delunification process and minimal diagrams ⋮ ON THE MAXIMUM NUMBER OF COLORS FOR LINKS ⋮ The minimum number of Fox colors modulo 13 is 5

Cites Work

• A proof of the Kauffman-Harary conjecture
• Knots and graphs. I: Arc graphs and colorings
• On the minimum number of colors for knots
• THE MINIMUM NUMBER OF FOX COLORS AND QUANDLE COCYCLE INVARIANTS
• MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES
• Any 7-colorable knot can be colored by four colors

This page was built for publication: THE TENEVA GAME