Publication | Closed Access
THE WARPING DEGREE OF A KNOT DIAGRAM
32
Citations
4
References
2010
Year
Geometric Graph TheoryDiscrete GeometryGraph TheoryGeometryKnot TheoryTopological Graph TheoryKnot KEducationCurve ModelingDiscrete MathematicsMonotone DiagramDegree DWarping DegreeComputational Topology
For an oriented knot diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain the monotone diagram from D in the usual way. We show that d(D) + d(-D) + 1 is less than or equal to the crossing number of D. Moreover, the equality holds if and only if D is an alternating diagram. For a knot K, we also estimate the minimum of d(D) + d(-D) for all diagrams D of K with c(D) = c(K).
| Year | Citations | |
|---|---|---|
Page 1
Page 1