Circuit preserving edge maps
暂无分享,去创建一个
It is proved that any one-to-one edge map f from a 3-connected graph G onto a graph H, G and H possibly infinite, satisfying f(C) is a circuit in H whenever C is a circuit in G is induced by a vertex isomorphism. This generalizes a result of Whitney which hypothesizes f(C) is a circuit in H if and only if C is a circuit in G.
[1] H. Whitney. Congruent Graphs and the Connectivity of Graphs , 1932 .