Knots and graphs. I: Arc graphs and colorings
From MaRDI portal
Publication:1284502
DOI10.1006/aama.1998.0634zbMath1128.57301OpenAlexW1988610952MaRDI QIDQ1284502
Frank Harary, Louis H. Kauffman
Publication date: 26 April 1999
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.1998.0634
Related Items
On the classification of rational tangles ⋮ Knot Theory ⋮ COLORING INVARIANTS OF VIRTUAL KNOTS AND LINKS ⋮ The minimum number of coloring of knots ⋮ Answer to a question by Nakamura, Nakanishi, and Satoh involving crossing numbers of knots ⋮ Any 11-Colorable knot can be colored with at most six colors ⋮ Describing semigroups with defining relations of the form \(xy=yz\) and \(yx=zy\) and connections with knot theory ⋮ Kauffman–Harary conjecture for alternating virtual knots ⋮ When can a link be obtained from another using crossing exchanges and smoothings? ⋮ MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES ⋮ The minimal coloring number of any non-splittable ℤ-colorable link is four ⋮ Minimal sufficient sets of colors and minimum number of colors ⋮ The palette numbers of torus knots ⋮ LUNE-FREE KNOT GRAPHS ⋮ Dehn coloring and the dimer model for knots ⋮ Minimal coloring number for ℤ-colorable links ⋮ KAUFFMAN–HARARY CONJECTURE HOLDS FOR MONTESINOS KNOTS ⋮ 7-colored 2-knot diagram with six colors ⋮ The delunification process and minimal diagrams ⋮ THE TENEVA GAME ⋮ Colorings beyond Fox: the other linear Alexander quandles ⋮ On the minimum number of colors for knots ⋮ The 6- and 8-palette numbers of links ⋮ ON THE MAXIMUM NUMBER OF COLORS FOR LINKS ⋮ Tangles, Rational Knots and DNA ⋮ On effective 9-colorings for knots ⋮ On the coloring of pseudoknots ⋮ The minimum number of Fox colors modulo 13 is 5 ⋮ Any 7-colorable knot can be colored by four colors ⋮ THE MINIMUM NUMBER OF FOX COLORS AND QUANDLE COCYCLE INVARIANTS ⋮ Removing colors 2k, 2k − 1, and k ⋮ Minimal coloring number for ℤ-colorable links II ⋮ Dehn colorings and vertex-weight invariants for spatial graphs ⋮ A proof of the Kauffman-Harary conjecture ⋮ Palettes of Dehn colorings for spatial graphs and the classification of vertex conditions ⋮ DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO TRIANGULAR AND HONEYCOMB LATTICES ⋮ DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES ⋮ The minimization of the number of colors is different at p = 11 ⋮ Positive quandle homology and its applications in knot theory
Cites Work
