Graph-links: nonrealizability, orientation, and Jones polynomial
From MaRDI portal
(Redirected from Publication:289738)
Recommendations
Cites work
- scientific article; zbMATH DE number 3606473 (Why is no real title available?)
- scientific article; zbMATH DE number 732199 (Why is no real title available?)
- scientific article; zbMATH DE number 2107523 (Why is no real title available?)
- scientific article; zbMATH DE number 960202 (Why is no real title available?)
- A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
- A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS
- A bracket polynomial for graphs. I
- ABSTRACT LINK DIAGRAMS AND VIRTUAL KNOTS
- An equivalence between the set of graph-knots and the set of homotopy classes of looped graphs
- Binary nullity, Euler circuits and interlace polynomials
- Chords in a circle and linear algebra over GF(2)
- Circle graph obstructions
- Cycle decomposition by disjoint transpositions
- Finite-type invariants of classical and virtual knots
- Framed 4-graphs: Euler tours, Gauss circuits and rotating circuits
- Free knots and groups
- Graph-links
- Graph-links
- INTRODUCTION TO GRAPH-LINK THEORY
- Introduction to Vassiliev knot invariants
- On the Melvin-Morton-Rozansky conjecture
- Parity in knot theory
- Parity in knot theory and graph-links
- VASSILIEV KNOT INVARIANTS COMING FROM LIE ALGEBRAS AND 4-INVARIANTS
- Virtual knot theory
- Virtual knots. The state of the art
Cited in
(4)
This page was built for publication: Graph-links: nonrealizability, orientation, and Jones polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289738)