Pages that link to "Item:Q4541038"
From MaRDI portal
The following pages link to COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS (Q4541038):
Displaying 11 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Computing HOMFLY polynomials of 2-bridge links from 4-plat representation (Q741749) (← links)
- Jones polynomial of knots formed by repeated tangle replacement operations (Q837637) (← links)
- A new characterization of graphic matroids (Q958686) (← links)
- Realizing Alexander polynomials by hyperbolic links (Q967469) (← links)
- Fast algorithms for computing Jones polynomials of certain links (Q1022582) (← links)
- Application of computer algebra to Jones polynomials (Q1406257) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- The parametrized complexity of knot polynomials (Q1877705) (← links)
- A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS (Q3560276) (← links)
- (Q4863284) (← links)