Abstract
Publisher Summary This chapter discusses edge maps and isomorphisms of graphs and presents an example for 3-connected graphs. A.K. Kelmans found an example of the 4-skein automorphism of a 4-connected graph that was not induced by an automorphism of the graph and proved that this example is unique among the 4-skein isomorphisms of 4-connected graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
