Colored Unlinking
From MaRDI portal
Abstract: In links with two components there are three different types of crossings: self-crossings in the first component, self crossings in the second component, and crossings between components. In this paper we examine the minimum number of crossing changes needed to unlink without changing the crossings between components. We restrict our attention to unlinking two component links with linking number zero and both components unknotted. We provide data for links with no more than ten crossings and general results about asymmetry of unlinking between components.
This page was built for publication: Colored Unlinking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6321272)
