Knot Diagrams of Treewidth Two

TL;DR

This paper investigates knot diagrams with underlying graphs of treewidth two, providing linear time algorithms to determine if they represent the unknot or unlink, and showing such diagrams can be simplified efficiently.

Contribution

It introduces linear time algorithms for unknot and unlink recognition in treewidth two knot diagrams and proves their diagrams can be simplified with a bounded number of Reidemeister moves.

Findings

Linear time algorithm for unknot recognition in treewidth two diagrams

Linear time algorithm for unlink recognition in treewidth two diagrams

Bound on the number of Reidemeister moves needed for simplification

Abstract

In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a link diagram of treewidth two we can test in linear time if it represents the unlink. From the algorithm, it follows that a diagram of the unknot of treewidth 2 can always be reduced to the trivial diagram with at most $n$ (un)twist and (un)poke Reidemeister moves.

Full text

1 Introduction

A knot is a piecewise linear closed curve $S^{1}$ embedded into the $3$-sphere $S^{3}$ (or the three-dimensional Euclidean space $\mathbb{R}^{3}$). Two knots are said to be equivalent if there is an ambient isotopy between them. In other words, two knots are equivalent if it is possible to distort one knot into the other without breaking it. The basic problem of knot theory is the following unknotting problem: given a knot, determine whether it is equivalent to a knot that bounds an embedded disk in $S^{3}$. Such a knot is called unknot.

Despite a significant progress, the computational complexity of the unknotting problem remains open. Even the existence of any algorithm for this problem is a highly non-trivial question. As was stated by Turing in 1954 in [14], “No systematic method is yet known by which one can tell whether two knots are the same.” The first algorithm resolving this problem is due to Haken [4]. By the celebrated result of Hass, Lagarias, and Pippenger [6], unknot recognition is in NP. The problem is also suspected to be in co-NP (assuming the Generalized Riemann Hypothesis), see the work of Kuperberg [8]. However, no polynomial algorithm for the unknotting problem is known.

It was understood already in 1920s that the question about equivalence of knots in $\mathbb{R}^{3}$ is reducible to a combinatorial question about knot diagrams [1, 11]. Knot diagrams are labeled planar graphs representing a projection of the knot onto a plane. Thus every vertex of the graph in knot diagram is of degree 4 and edges are marked as overcrossing and undercrossing, see Section 2 for a formal definition. It is one of the most fundamental theorems in knot theory from 1920s that any two diagrams of a knot or link in $\mathbb{R}^{3}$ differ by a sequence of Reidemeister moves [11], illustrated in Fig. 1. We refer to these moves as (I) twist moves, (II) poke moves, and (III) slide moves, with the reverse operation of a twist move the untwist, and the reverse operation of a poke the unpoke.

In particular, the diagram of every unknot can be reduced to the trivial diagram (a circle) by performing Reidemeister moves. While each of the Reidemeister moves can be performed in polynomial time, it is very unclear how many of these moves are required to move an unknot to the trivial diagram. The problem is that sometimes a successful unknotting sequence of Reidemeister moves is not monotone, that is, it has to increase the number of crossings (vertices) in the knot diagram, see e.g. [9]. Bounding the number of required Reidemeister moves by any function on the number of vertices in the knot diagram was a long-standing open question in the area. The answer to this question was given by Hass and Lackenby [5] who gave the first (exponential) upper bound on the number of Reidemeister moves. Later Lackenby in [9] improved the bound significantly by showing that any diagram of the unknot with $n$ crossings may be reduced to the trivial diagram using at most $(236n)^{11}$ Reidemeister moves. Let us note that this also implies that unknot recognition problem is in NP.

In this work we consider the unknotting problem when the given knot diagram has treewidth at most $2$. We defer the definition of treewidth till the next section. Our main algorithmic result is the following theorem.

Theorem 1**.**

Deciding whether any diagram with $n$ crossings and treewidth at most $2$ is a diagram of the unknot can be decided in time $O(n)$.

Our proof yields also the following combinatorial result about the number of Reidemeister moves. It is interestingly to note that in Theorem 2 we do not use the slide move.

Theorem 2**.**

Any diagram of treewidth $2$ of the unknot with $n$ crossings may be reduced to the trivial diagram using at most $n$ (un)twist and (un)poke Reidemeister moves.

Actually, the techniques developed to prove Theorems 1 and 2 can be used to solve a slightly more general problems about links, that is collection of knots which do not intersect, with diagrams of treewidth $2$.

Related work. To the best of our knowledge, the question whether the unknotting problem with diagrams of bounded treewidth can be resolved in polynomial time is open. Makowsky and Mariño in [10] studied the parametrized complexity of the knot (and link) polynomials known as Jones polynomials, Kauffman polynomials and HOMFLY polynomials on graphs of bounded treewidth. Rué et al. [13] studied the class of link-types that admit a $K_{4}$-minor-free diagram (which is of treewidth at most $2$). They obtain counting formulas and asymptotic estimates for the connected $K_{4}$-minor-free link and unknot diagrams.

2 Preliminaries

2.1 Treewidth

We first define the notion of treewidth, as introduced by Robertson and Seymour [12]. There are many equivalent definitions, see e.g., [2]; the most common definition is the following.

A tree decomposition of a graph $G=(V,E)$ is a pair $(\{X_{i}\leavevmode\nobreak\ |\leavevmode\nobreak\ i\in I\},T=(I,F))$, with $\{X_{i}\leavevmode\nobreak\ |\leavevmode\nobreak\ i\in I\}$ a family of subsets of $V$, and $T$ a tree, such that $\bigcup_{i\in I}X_{i}=V$, for all $\{v,w\}\in E$, there is an $i\in I$ with $v,w\in X_{i}$, and for all $v\in V$, the set $\{i\in I\leavevmode\nobreak\ |\leavevmode\nobreak\ v\in X_{i}\}$ forms a connected subtree of $T$. The width of a tree decomposition is $\max_{i\in I}|X_{i}|-1$, and the treewidth of a graph $G$ is the minimum width of a tree decomposition of $G$.

In this paper, we focus on graphs of treewidth two. We do not need the representation by tree decompositions in this paper, but instead rely on a simple procedure that can be used to recognize graphs of treewidth 2 (Theorem 3). Graphs of treewidth two are sometimes also called series-parallel, but as there are different definitions of what is a series-parallel graph (e.g., whether $K_{1,3}$ is series-parallel depends on the used definition), avoid ambiguity by using treewidth terminology.

The following result is well known.

Theorem 3** (Folklore, see e.g., [2]).**

A graph $G=(V,E)$ has treewidth at most two, if it can be reduced to the empty graph by repeating the following operations, while possible:

• •

Remove a vertex of degree 0.

• •

Remove a vertex of degree 1 and its incident edge.

• •

Contract a vertex of degree 2 with a neighbor (possibly creating a parallel edge).

• •

Remove one of a pair of parallel edges.

Notice, the operations from Theorem 3 are applied to the vertices of degree up to two. Thus, for attacking the unknoting problem on a knot diagram of treewidth two, we can apply the above reduction operations to the small degree vertices of the knot diagram while maintaining ambient isotopy of the knots. This results in small unknots, knots, unlinks and links which are trivially recognizable.

A subdivision in a graph $G=(V,E)$ is a vertex of degree two. The operation to add a subdivision is the following: take an edge $\{v,w\}$, and replace this edge by edges $\{v,x\}$ and $\{x,w\}$ with $x$ a new vertex. The operation to remove a subdivision is the following: take a vertex of degree 2, add an edge between its neighbors and then remove the vertex and its incident edges.

2.2 Knot diagrams

In this section, we introduce the notion of a knot (link) diagram. In the literature, variations on this definition are used, where the most common definition is as follows. The knot (link) diagram is an immersed plane curve which is a projection of a knot (link) on the plane with the additional data of which strand/string is over and which is under at each crossing. We slightly extend this definition keeping precisely the same expressive power. Namely, we introduce a plane graph describing the knot diagram. This graph is useful for our algorithm.

Given a projection of a knot on the plane, we put a vertex at each string crossing. Conventionally, we assume that the knot projection is such that every vertex represents a crossing of exactly two strings. Two vertices are adjacent if they represent two consecutive crossings on a string. Thus, all vertices introduced so far have degree four. Notice, two consecutive crossings on a string could be at the same vertex, meaning there is a (self)loop on that vertex. Moreover, two vertices might represent consecutive crossings on more than one string, meaning there are parallel or multi-edges. To make the graph simple, for each loop and each multi-edge we introduce a degree two vertex subdividing the loop/multi-edge. Now, each vertex of a simple graph have either degree two or degree four. We refer to the resulting undirected simple plane graph $G=(V,E)$ as a knot diagram.

For keeping the information which string is over and which string is under at each crossing, we label the endpoints of the edges. Consider a vertex of degree four representing a crossing of two strings. Consider an edge representing an overcrossing string at that vertex. We label the endpoint of the overcrossing edge with $u$ (for “up”). The endpoints of the undercrossing edges are labeled with $d$ (for “down”); see Figure 2 for an illustration. Now, we label the endpoints at vertices of degree two. If an edge has one (labeled) endpoint at a vertex of degree four and an endpoint at a vertex of degree two, the endpoint at the vertex of degree two receives the same label as the endpoint at the vertex of degree four. Notice, the labels of the same edge at two endpoints might be different.

2.3 Generalized knot diagrams

Our algorithm is based upon a generalization of knot diagrams, which we call generalized knot diagrams. The main ingredient is a new type of edges, which are created in the course of the algorithm. While a single edge in a knot diagram represents a piece of a single string, a double edge in a generalized knot diagram represents two pieces of strings between two pairs of vertices of degree two. Specifically, consider any two pieces of strings not intersected by any other piece of string. Let the two pieces of strings have the (four) endpoints at vertices of degree two. Moreover, let the strings alternate at every two consecutive crossings with respect to over- and under-crossing, i.e., if string $s$ is over-crossing string $s^{\prime}$ at a crossing, then at the next (consecutive) crossing $s^{\prime}$ is over-crossing $s$. In accordance with Reidemeister terminology, we refer to these alternating crossings as twists. Such two strings with twists between two pairs of vertices of degree two are referred as double edges.

For each double edge we create an integer label that gives the number of twists/crossings in the double edge. If the two pieces of string do not cross, the label is zero. With labelings of endpoints of the strings with $u$ (up) and $d$ (down), we can distinguish between overcrossings and undercrossings; details are given later in this section.

See Figure 3 for an illustration how a double edge represents two pieces of string with three twists.

In the generalized knot diagram we identify a pair of degree two vertices associated with an endpoint of a double edge as one double vertex, thus creating a new simple graph with a mix of knot diagram (single) vertices, double vertices, single and double edges, where double edges are labeled with numbers of twists.

In the construction and in the algorithm, we will ensure that a double vertex is never incident to three double edges, or to two double edges and one single edge. Thus, a double vertex is either incident to exactly one double edge, or two double edges, or one double and two single edges. The different cases are illustrated in Figure 4.

We also distinguish two types of degrees of vertices in knot diagrams. The graph degree of a vertex is the number of incident single and double edges. The diagram degree of a vertex is the number of incident single edges plus twice the number of incident double edges. In a generalized knot diagram, each vertex has diagram degree two or four. Hence, in a generalized knot diagram we have the following types of vertices.

• •

A double vertex incident to a double edge. It has graph degree one, and diagram degree two. This is the case when the double vertex is formed by a pair of adjacent vertices. (Vertex $v$ in Figure 4.)

• •

A single vertex incident to two single edges. It has graph degree two and diagram degree two.

• •

A double vertex incident to two double edges. It has graph degree two and diagram degree four. (Vertex $w$ in Figure 4.)

• •

A double vertex incident to one double edge and two single edges. It has graph degree three and diagram degree four. (Vertex $x$ in Figure 4.)

• •

A single vertex incident to four single edges. (See Figure 2.)

The over- and under-crossing labels at the endpoints of double edges are determined by the $\{u,d\}$-labeling of the endpoints of the two pieces of strings. Consider an endpoint of a double edge at a double vertex formed by two single vertices, $x$ and $y$, both of diagram degree two. Assuming an initial global ordering of single vertices in the knot diagram, without loss of generality, let $x$ precedes $y$ in that order. Then, if the endpoint of a single edge at $x$ has label $u$, we assign to the endpoint of the double edge label $ud$; and $du$ for otherwise. Notice, given a number of twists in a double edge and a $\{u,d\}$-label of any of the single endpoints of the knot diagram, the labels of all other single endpoints and the labels of the double edge endpoints are uniquely determined; see Figure 5.

When addressing the unknotting (and unlinking) problem, we will apply the reduction operations from Theorem 3 transforming a knot diagram into a generalized knot diagram. Notice, a knot diagram is a special type of a generalized knot diagram, namely the one where each edge is a single edge.

2.4 Reidemeister moves

With help of Reidemeister moves, see Figure 1, we obtain an equivalence relation on knot diagrams: if a diagram can be obtained from another by zero or more Reidemeister moves, then these diagrams are equivalent. A diagram is said to be an unknot, if and only if it is equivalent to a diagram with only vertices of diagram degree 2. To simplify notations, we also allow to add subdivisions of edges, or to remove vertices of diagram degree 2 and connect their neighbors.

3 Main Algorithm

We first give the main shape of the algorithm. The algorithm maintains a generalized knot diagram and the underlying simple graph, obtained by ignoring all markings and ignoring the difference between double and single edges. Let us call this underlying simple graph $G^{s}$. Note that $G^{s}$ has treewidth at most 2, and the degree of a vertex in $G^{s}$ is its graph degree.

With help of the reduction rules of the next section, we build our linear time algorithm. Our algorithm can be seen as a variation of the reduction algorithm for treewidth 2 graphs, as described in Theorem 3.

The main form of our algorithm is the following. The input is a knot diagram $K$ of treewidth 2.

• •

Subdivide parallel edges in $K$, and subdivide selfloops. $K$ now is a generalized knot diagram, yet without double edges, but without parallel edges or selfloops. Compute the underlying simple graph $G^{s}$.

• •

Repeat till we decided that we have a knot, a link, or $G^{s}$ has at most three vertices:

• –

Take a vertex $v$ of graph degree at most 2.

• –

Apply a safe rule (defined in the next section) to $K$, that removes $v$. Let again $G^{s}$ be the resulting simple graph.

• •

If $G^{s}$ has at most three vertices, then classify the generalized knot diagram $K$ with help of a simple case analysis.

In the description above, equivalence is topological: if we transform a generalized knot diagram $K_{1}$ to a new generalized knot diagram $K_{2}$, $K_{1}$ represents a knot diagram that can be obtained by Reidemeister moves from a knot diagram that is represented by $K_{2}$.

We can distinguish three different cases for the vertex $v$ of degree at most 2 in the algorithm above: $v$ has graph degree one, and hence is incident to one double edge; $v$ has graph degree 2 and is incident to two single edges; $v$ has graph degree 2 and is incident to two double edges. Each of these cases is discussed in detail in the next section, where we see how we can transform in constant time the generalized knot diagram to an equivalent one, which has the new $G^{s}$ as underlying simple graph. As in each round, we lose one vertex, the algorithm has at most $n$ rounds.

Standard algorithmic techniques allow to implement the selection of $v$ and maintenance of $G^{s}$ in linear time. We use the adjacency list data structure to represent $G^{s}$. In addition, we have a set data structure $S$ for vertices of graph degree at most 2. If we delete $v$, we check if the neighbors of $v$ have their degree decreased to a value at most 2, and if so, add these to $S$. Selecting $v$ can be done by just taking an element from $S$. We can e.g. use a standard queue for $S$.

What remains is to look at the rules that deal with each of the cases, which is done in the next section.

4 Safe Reduction Rules

In this section we introduce a number of reduction rules for generalized knot diagrams. The result of a rule is always again a generalized knot diagram. Note that we always remove one (single or double) vertex of graph degree at most 2, and possibly add an edge between the neighbors of a removed vertex of degree 2. Thus, when any of these rules is applied, the size of the generalized knot diagram is decreased by at least one vertex.

A rule is safe if application of the rule preserves the ambient isotopy of the original and the resulting knots. For all rules in this section, the knots equivalence is maintained due to the fact that each of the rules is either a Reidemeister move(s) or removing the subdivision.

4.1 Vertices incident to one double edge

We first look at vertices of graph degree 1. Such a vertex must be a double vertex, incident to a double edge. We have the following rule.

Rule 1**.**

Let $\{v,w\}$ be a double edge, with the graph degree of $v$ equal to one. Remove $v$ and the edge $\{v,w\}$. If double vertex $w$ was incident to two single edges $e$ and $e^{\prime}$, make $w$ a single vertex of degree two incident to the same edges and keep the $\{u,d\}$-labels at the endpoint $w$ of $e$ and $e^{\prime}$ intact; this case is illustrated in Figure 6. If $w$ was incident to another double edge, keep $w$ a double vertex formed by two adjacent single vertices.

Lemma 3.1**.**

Rule 1 is safe.

Proof.

Let $\{v,w\}$ be a double edge having $i$ twists. We first apply $i$ Reidemeister untwists to the double edge $\{v,w\}$, resulting in a subdivided path between two single vertices forming the double vertex at $w$. Then, the rule introduces two cases. If $w$ is incident to two single edges, we contract the entire path into a single vertex incident to two single edges. If $w$ is incident to a double edge, we contract the path to an edge between two vertices forming a double vertex. In both cases we execute Reidemeister moves followed by contraction of a subdivided path. As both operations are safe, the rule is safe as well. ∎

4.2 Vertices incident to two single edges

Consider a single vertex $v$ incident to two single edges $\{v,w\}$ and $\{v,x\}$. We consider three cases: 1) $w$ and $x$ are not adjacent; 2) $w$ and $x$ are adjacent by a single edge; 3) $w$ and $x$ are adjacent by a double edge. Consider the first case.

Rule 2**.**

Let $v$ be incident to two single edges $\{v,w\}$ and $\{v,x\}$, where $w$ and $x$ are not adjacent. Remove $v$ and the edges $\{v,w\}$ and $\{v,x\}$, and add a single edge $\{w,x\}$. Keep the $\{u,d\}$-labels of edge $\{w,x\}$ at $w$ and $x$ the same as in $\{v,w\}$ and $\{v,x\}$, respectively.

Rule 2 is trivially safe as we just remove an edge subdivision. See Figure 7.

Consider the second case where $w$ and $x$ are adjacent by a single edge.

Rule 3**.**

Let $v$ be incident to two single edges $\{v,w\}$ and $\{v,x\}$, where $w$ and $x$ are adjacent by a single edge.

If all three vertices $v,w,x$ are single vertices of graph degree 2, forming a simple cycle of length three, we do not apply any further rules as the diagram represents the unknot. 2. 2.

If $w$ is a single vertex of graph degree 2 and $x$ is a single vertex of graph degree 4, we delete vertices $v$ and $w$ together with edges $\{v,w\},\{v,x\}$ and $\{w,x\}$. 3. 3.

If $w$ is a single vertex of graph degree 2 and $x$ is a double vertex of graph degree 3, we delete vertices $v$ and $w$ together with edges $\{v,w\},\{v,x\}$ and $\{w,x\}$, and we make the two vertices forming double vertex $x$ adjacent.

If $w$ and $x$ are two single vertices of graph degree 4 and the $\{u,d\}$-labels of single edges $\{v,w\}$ and $\{v,x\}$ at vertices $w$ and $x$ (respectively) are the same, we delete vertex $v$ together with edges $\{v,w\},\{v,x\}$ and $\{w,x\}$, and we create a double edge $\{w,x\}$ of 0 twists. To assign the $\{u,d\}$-labels at vertices $w$ and $x$, we split each of these vertices into two non-adjacent copies, one per single edge incident to the vertex. We connect the over-/undercrossing endpoint of $\{w,x\}$ at $w$ with the over-/undercrossing endpoint of $\{w,x\}$ at $x$, respectively, see Figure 9.

If $w$ and $x$ are two single vertices of graph degree 4 and the $\{u,d\}$-labels of single edges $\{v,w\}$ and $\{v,x\}$ at vertices $w$ and $x$ (respectively) are different, we delete vertex $v$ together with edges $\{v,w\},\{v,x\}$ and $\{w,x\}$, and we create a double edge $\{w,x\}$ of 2 twists. To assign the $\{u,d\}$-labels at vertices $w$ and $x$, we again split each of these vertices into two non-adjacent copies, one per single edge incident to the vertex. We keep the $\{u,d\}$-labels at endpoints of $\{w,x\}$ identical to the labels of the incident single edges, see Figure 10.

If $w$ is a single vertex of graph degree 4 and $x$ is a double vertex of graph degree 3, we delete vertex $v$ together with edges $\{v,w\},\{v,x\}$ and $\{w,x\}$, we split vertex $w$ into two non-adjacent copies (one per string at the crossing represented by vertex $w$), thus creating a double vertex $w$, and we create a double edge $\{w,x\}$ of 1 twist. Now, we assign the $\{u,d\}$-labels at the endpoints of the new double edge $\{w,x\}$. At double vertex $w$ the endpoint corresponding to the overcrossing (undercrossing) string receives label $u$ (and $d$), respectively. Since the number of twists in double edge $\{w,x\}$ is 1, at double vertex $x$ the labels at the endpoints of the strings alternate, see Figure 11.

If both $x$ and $w$ are double vertices of graph degree 3, we delete vertex $v$ together with edges $\{v,w\},\{v,x\}$ and $\{w,x\}$, and we create a double edge $\{w,x\}$ of 0 twists, keeping the $\{u,d\}$-labels at endpoints as is.

Lemma 3.2**.**

Rule 3 is safe.

Proof.

The first three cases are illustrated in Figure 8. The first case is the trivial unknot. In the second case, we do one Reidemeister untwist that removes the crossing at $x$, and subsequently we remove the subdivision. The third case is just removing the subdivision.

The fourth case, illustrated in Figure 9 is a Reidemeister unpoke and removing the subdivision. In this case we see we still have a generalized knot diagram because each of the newly created double vertices is incident to one double and two single edges by construction.

In the fifth and in the sixth cases, see Figure 10 and Figure 11, we keep exactly the same knot diagram, but the generalized knot diagram representing the knot is changed to one with fewer vertices. The same holds for the seventh case. ∎

We now look at the third main case. Suppose $v$ is adjacent by two single edges to two double vertices, $w$ and $x$, and there is a double edge between $w$ and $x$ having $i$ twists.

Rule 4**.**

Suppose $v$ has two single edges, to $w$ and $x$ respectively, and there is a double edge between $w$ and $x$ with $i$ twists.

If $i=0$, then the generalized knot diagram represents an unlink. We recurse on the part of the graph having more than three vertices. 2. 2.

If $i\neq 1$ is odd, the generalized knot diagram represents a knot; 3. 3.

If $i\neq 0$ is even, the generalized knot diagram represents a link. 4. 4.

If $i=1$, then delete vertex $v$ together with adjacent edges and delete double edge $\{w,x\}$, make $w$ and $x$ single vertices adjacent by a single edge.

Correctness of the first three cases is evident; see Figure 12. Safeness of the fourth case follows as this step represents a single Reidemeister untwist with subsequent contraction of subdivision, see Figure 13.

4.3 Vertices incident to two double edges

Consider a double vertex $v$ incident to two double edges $\{v,w\}$ and $\{v,x\}$ of $i$ and $j$ twists, respectively. We consider three cases: 1) $w$ and $x$ are not adjacent; 2) $w$ and $x$ are adjacent by a single edge; 3) $w$ and $x$ are adjacent by a double edge. Consider the first case.

Rule 5**.**

Let $v$ be incident to two double edges $\{v,w\}$ and $\{v,x\}$, where $w$ and $x$ are not adjacent. Remove $v$ and the edges $\{v,w\}$ and $\{v,x\}$, and add a double edge $\{w,x\}$. If the endpoints of $\{w,v\}$ and $\{v,x\}$ at $v$ were agreeing on the $\{u,d\}$-labels, i.e., the labels of the endpoints on the same strings were the same, define the number of twists on the new double edge $\{w,x\}$ by $|i-j|$. If the number of twists $i$ in double edge $\{v,w\}$ is greater than the number of twists $j$ in double edge $\{v,x\}$, keep the $\{u,d\}$-labels at $w$ intact and alternate at $x$, otherwise keep the labels at $x$ and alternate at $w$.

If the endpoints were disagreeing on the labels, i.e., the labels of the endpoints on the same strings were different, define the number of twists of edge $\{w,x\}$ by $i+j$. Keep the $\{u,d\}$-labels of edge $\{w,x\}$ at $w$ and $x$ the same as in $\{v,w\}$ and $\{v,x\}$, respectively.

Lemma 3.3**.**

Rule 5 is safe.

Proof.

In the case of agreement on labels, see Figure 14, we proceed with $\min\{i,j\}$ Reidemeister unpoke moves followed by removing the subdivision. In case of label disagreement, see Figure 15, we keep exactly the same knot diagram, but simplify the generalized knot diagram by removing the subdivision on the double edge. In the latter case the number of twists on the new double edge is exactly the sum $i+j$ of the twists on the two original double edges. ∎

Rule 6**.**

Let $v$ be incident to two double edges, $\{v,w\}$ and $\{v,x\}$, where $w$ and $x$ are adjacent by a single edge. This case can be transformed to the case considered in Rule 4. First, we add a subdivision of $\{w,x\}$. Then, we apply Rule 5 arriving in and applying one of the cases of Rule 4, see Figure 16. Therefore, we either classify the diagram or safely reduce the graph.

Rule 7**.**

Consider three double vertices $v,w$ and $x$ with three double edges, $\{v,w\},\{x,v\}$ and $\{w,x\}$ of $i,j$ and $k$ twists, respectively. In this case, the knot diagram is completely and uniquely classifiable. We apply Rule 5 to double vertex $v$ obtaining a generalized knot diagram with only two double vertices $w$ and $x$ adjacent by two parallel double edges. The original edge $\{w,x\}$ has $k$ twists. The new edge $\{w,x\}$ has $\ell$ twists, where $\ell$ is either $|i-j|$ or $i+j$ dependent on the case for Rule 5, i.e., on the agreement of $\{u,d\}$-labels at $v$. Next, we apply Rule 5 again to double vertex $w$ obtaining a generalized knot diagram with a single double vertex $x$ and a self-loop with $m$ twists, where $m$ is either $|\ell-k|$ or $\ell+k$ dependent on the agreement of $\{u,d\}$-labels at $w$. Finally, we are ready to classify the knot diagram:

If $m=0$, then the generalized knot diagram represents the unlink; 2. 2.

If $m\neq 1$ is odd, the generalized knot diagram represents the $(m,2)$-torus knot, for definition and notations see **[15]**; 3. 3.

If $m\neq 0$ is even, the generalized knot diagram represents the $(m,2)$-torus link; 4. 4.

If $m=1$, then the generalized knot diagram represents the unknot as a single Reidemeister untwist turns the diagram to a circle.

5 Conclusions

We conclude with the following questions.

• •

We gave a linear time algorithm deciding whether any diagram with $n$ crossings and treewidth at most $2$ is a diagram of the unknot. Is it possible to extend our result to graphs of treewidth $t\geq 3$? Even the existence of a polynomial time algorithm for $t=3$ is open.

• •

We also proved that any diagram of treewidth $2$ of the unknot with $n$ crossings may be reduced to the trivial diagram using at most $n$ Reidemeister moves. Is it true, that any diagram of treewidth $t\geq 3$ of the unknot could be reduced to the trivial diagram in at most $f(t)\cdot n$ moves for some function $f$ of $t$ only?

• •

Koenig and Tsvietkova [7] and de Mesmay et al. [3] proved that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. Could this problem be solved in polynomial time on knots with diagrams of treewidth $2$?