Circuit Preserving Edge Maps
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.