COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS
From MaRDI portal
Publication:4541038
DOI10.1142/S0218216501001104zbMath0998.57026OpenAlexW1980126517MaRDI QIDQ4541038
Publication date: 30 July 2002
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218216501001104
Related Items
The parametrized complexity of knot polynomials ⋮ Jones polynomial of knots formed by repeated tangle replacement operations ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ A new characterization of graphic matroids ⋮ Realizing Alexander polynomials by hyperbolic links ⋮ Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width ⋮ Computing HOMFLY polynomials of 2-bridge links from 4-plat representation ⋮ Fast algorithms for computing Jones polynomials of certain links
Cites Work
This page was built for publication: COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS
