A reduced set of moves on one-vertex ribbon graphs coming from links
classification
🧮 math.GT
math.CO
keywords
linkone-vertexribboncomingdiagramseverygraphgraphs
read the original abstract
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.