Kantenprimitive Graphen vom Grad drei

A graph is called edge- (vertex-) primitive if the group of automorphisms acts as a primitive permutation group on the set of edges (vertices). It is shown that there are only four edge-primitive trivalent graphs. Three are bipartite cages; the fourth, with 102 vertices, is also vertex-primitive.