1. Fachbereich Mathematik Technische Universit?t Berlin, Berlin, West Germany 2. Profsoyuznaya Str. 130 K. 3, kv, 33, 117321, Moscow, USSR 3. Department of Mathematics, Vanderbilt University, 37235, Nashville, Tennesse, USA
Abstract:
It is shown that a 3-skein isomorphism between 3-connected graphs with at least 5 vertices is induced by an isomorphism. These graphs have no loops but may be infinite and have multiple edges.