Knots and graphs. I: Arc graphs and colorings

DOI10.1006/aama.1998.0634zbMath1128.57301MaRDI 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

zbMATH Keywords

knot and link diagrams; combinatorial knot theory

Mathematics Subject Classification ID

57M15: Relations of low-dimensional topology with graph theory

Related Items

The minimal coloring number of any non-splittable ℤ-colorable link is four, THE TENEVA GAME, ON THE MAXIMUM NUMBER OF COLORS FOR LINKS, Palettes of Dehn colorings for spatial graphs and the classification of vertex conditions, COLORING INVARIANTS OF VIRTUAL KNOTS AND LINKS, The minimum number of coloring of knots, Tangles, Rational Knots and DNA, On effective 9-colorings for knots, On the coloring of pseudoknots, Removing colors 2k, 2k − 1, and k, Minimal coloring number for ℤ-colorable links II, The minimization of the number of colors is different at p = 11, Minimal sufficient sets of colors and minimum number of colors, The palette numbers of torus knots, KAUFFMAN–HARARY CONJECTURE HOLDS FOR MONTESINOS KNOTS, Any 7-colorable knot can be colored by four colors, DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES, The delunification process and minimal diagrams, The 6- and 8-palette numbers of links, The minimum number of Fox colors modulo 13 is 5, A proof of the Kauffman-Harary conjecture, Answer to a question by Nakamura, Nakanishi, and Satoh involving crossing numbers of knots, Describing semigroups with defining relations of the form \(xy=yz\) and \(yx=zy\) and connections with knot theory, Colorings beyond Fox: the other linear Alexander quandles, On the classification of rational tangles, Dehn colorings and vertex-weight invariants for spatial graphs, Positive quandle homology and its applications in knot theory, When can a link be obtained from another using crossing exchanges and smoothings?, 7-colored 2-knot diagram with six colors, On the minimum number of colors for knots, Any 11-Colorable knot can be colored with at most six colors, Kauffman–Harary conjecture for alternating virtual knots, Dehn coloring and the dimer model for knots, Minimal coloring number for ℤ-colorable links, THE MINIMUM NUMBER OF FOX COLORS AND QUANDLE COCYCLE INVARIANTS, DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO TRIANGULAR AND HONEYCOMB LATTICES, Knot Theory, MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES, LUNE-FREE KNOT GRAPHS

Cites Work

• A classifying invariant of knots, the knot quandle
• Parallel concepts in graph theory
• GAUSS CODES, QUANTUM GROUPS AND RIBBON HOPF ALGEBRAS
• Unnamed Item
• Unnamed Item