Abstract
For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D in the usual way. We show that d(D) + d(-D) + sr(D) is less than or equal to the crossing number of D, where -D denotes the inverse of D and sr(D) denotes the number of component subdiagrams which have at least one self-crossing. Moreover, we prove the condition of the equality. We also consider the minimal d(D)+d(-D)+sr(D) for all diagrams D. And for the warping degree and linking warping degree, we show some relations to the linking number, unlinking number, and the splitting number.

This publication has 4 references indexed in Scilit: