Abstract
A ravel is a spatial graph which is non-planar but contains no non-trivial knots or links. We characterize when a Montesinos tangle can become a ravel as the result of vertex closure with and without replacing some number of crossings by vertices.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.