Ordering the Reidemeister moves of a classical knot (Q2492046)

This paper refines Reidemeister's classical theorem to show that if two diagrams represent the same link then there is a sequence of Reidemeister moves connecting them in which increasing moves of type I and then type II are done first, followed by type III moves and finally decreasing moves of type II and then type I. Type I moves can be omitted if corresponding components all have the same writhe and winding number. The proof is combinatorially based, using some preliminary lemmas to permit the inductive modification of an original minimal sequence of unsorted moves between the diagrams.