Circuit Preserving Edge Maps
Combinatorics
2017-11-29 v2
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.
Keywords
Cite
@article{arxiv.1711.09341,
title = {Circuit Preserving Edge Maps},
author = {Jon Henry Sanders and David Sanders},
journal= {arXiv preprint arXiv:1711.09341},
year = {2017}
}
Comments
6 pages 0 figures, corrected typo in abstract