Any 7-colorable knot can be colored by four colors
From MaRDI portal
Publication:5962091
DOI10.2969/jmsj/06230963zbMath1202.57010OpenAlexW1982910797MaRDI QIDQ5962091
Publication date: 16 September 2010
Published in: Journal of the Mathematical Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2969/jmsj/06230963
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
The minimum number of coloring of knots, Any 11-Colorable knot can be colored with at most six colors, MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES, 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, On the minimum number of Fox Colorings of Knots, 7-colored 2-knot diagram with six colors, Linear Alexander quandle colorings and the minimum number of colors, The delunification process and minimal diagrams, THE TENEVA GAME, The 6- and 8-palette numbers of links, ON THE MAXIMUM NUMBER OF COLORS FOR LINKS, On effective 9-colorings for knots, The minimum number of Fox colors modulo 13 is 5, THE MINIMUM NUMBER OF FOX COLORS AND QUANDLE COCYCLE INVARIANTS, Removing colors 2k, 2k − 1, and k, The palette numbers of 2-bridge knots, The minimization of the number of colors is different at p = 11
Cites Work
- 5-colored knot diagram with four colors
- Knots and graphs. I: Arc graphs and colorings
- Virtual knot theory
- On the minimum number of colors for knots
- THE MINIMUM NUMBER OF FOX COLORS AND QUANDLE COCYCLE INVARIANTS
- VIRTUAL KNOT PRESENTATION OF RIBBON TORUS-KNOTS
- Metacyclic Invariants of Knots and Links
- Unnamed Item
- Unnamed Item