|
|
|
A tree of Links obtained by repeatedly choosing a crossing, applying the Skein Relationship to obtain two simpler Links, and repeating the process. The Depth of a resolving tree is the number of levels of links, not including the top. The Depth of the Link is the minimal depth for any resolving tree of that Link.