Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
https://doi.org/10.1142/S0218216522500134Cited by:2 (Source: Crossref)

This paper mainly studies the minimum number of colorings for all non-trivially 19-colored diagrams of any 19-colorable knot K. By using some special Reidemeister move, we successfully eliminated 13 colors from 19 colors. It can be seen that for any 19-colorable knot K, at least six colors are enough to color K, that is, the minimum number of 19-colorable knot is six.

AMSC: 57K10