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.
"Ravels Arising from Montesinos Tangles." Tokyo J. Math. 40 (2) 393 - 420, December 2017. https://doi.org/10.3836/tjm/1502179235