On a Planarity Criterion Coming from Knot Theory

J. Sawollek

A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagr…