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.
Similar content being viewed by others
References
R. Halin andH. A. Jung, Note on isomorphisms of graphs,J. London Math. Soc. 42 (1967), 254–256.
R. L. Hemminger, Isomorphism-induced line isomorphisms on pseudographs,Czechoslovak Math. J. (96) (1971), 672–679.
R. L. Hemminger andH. A. Jung, Onn-skein Isomorphisms of Graphs,J. Combinatorial Theory (B),32 (1982), 103–111.
H. A. Jung, Zu einem Isomorphiesatz von H. Whitney für Graphen,Math. Ann. 164 (1966), 270–271.
J. H. Sanders andD. Sanders, Circuit preserving edge maps,J. Combinatorial Theory (B) 22 (1977), 91–96.
H. Whitney, Congruent graphs and the connectivity of graphs,Amer. J. Math. 54 (1932), 150–168.
H. Whitney, 2-isomorphic graphs,Amer. J. Math. 55 (1933), 245–254.
Author information
Authors and Affiliations
Additional information
The paper was written while this author was visiting Universität für Bildungswissenschaften, Klagenfurt, Austria.