ON COMPUTING KAUFFMAN BRACKET POLYNOMIAL OF MONTESINOS LINKS
From MaRDI portal
Publication:4930563
DOI10.1142/S0218216510008297zbMath1206.57015MaRDI QIDQ4930563
Publication date: 29 September 2010
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
05C10: Planar graphs; geometric and topological aspects of graph theory
57M15: Relations of low-dimensional topology with graph theory
05C20: Directed graphs (digraphs), tournaments
Related Items
The Yamada polynomial of spatial graphs obtained by edge replacements, The architecture and the Jones polynomial of polyhedral links, Density of roots of the Yamada polynomial of spatial graphs
Uses Software
Cites Work
- Unnamed Item
- Computer algebra and colored Jones polynomials
- A Tutte polynomial for signed graphs
- Fast algorithms for computing Jones polynomials of certain links
- State models and the Jones polynomial
- Hecke algebra representations of braid groups and link polynomials
- The Jones polynomial of pretzel knots and links
- Chromatic polynomials of homeomorphism classes of graphs
- Application of computer algebra to Jones polynomials
- The Kauffman brackets for equivalence classes of links
- The replacements of signed graphs and Kauffman brackets of link families
- A polynomial invariant for knots via von Neumann algebras
- New Invariants in the Theory of Knots
- EXPLICIT DESCRIPTION OF THE HOMFLY POLYNOMIALS FOR 2-BRIDGE KNOTS AND LINKS
- On the computational complexity of the Jones and Tutte polynomials
- A Contribution to the Theory of Chromatic Polynomials