On n-skein isomorphisms of graphs

R.L Hemminger, H.A Jung
1982 Journal of combinatorial theory. Series B (Print)  
proved that edge isomorphisms between connected graphs with at least five vertices are induced by isomorphisms and that circuit isomorphisms between 3-connected graphs are induced by isomorphisms. R. Hahn and H. A. Jung [J. London Math. Sot. 42 (1967), 254-2561 generalized these results by showing that for n) 2, n-skein isomorphisms between (n + I)-connected graphs are induced by isomorphisms. In this paper we show that for n ) 2, n-skein isomorphisms between 3-connected graphs having (n + I)-skeins are induced by isomorphisms.
doi:10.1016/0095-8956(82)90027-2 fatcat:nakqkwfb2ffytgka45allr76zu