A characterization of infinite planar primitive graphs (Q1826955)

The paper contains the description of the structure of any infinite, locally finite, planar graph whose automorphism group acts primitively on its set of vertices. Namely, it is shown that a graph satisfies these properties if and only if it has the connectivity 1, and for some integer \(m \geq 2\), every vertex is incident with exactly \(m\) lobes all of which are finite and all of which are either isomorphic to \(K_4\) or all of which are isomorphic to a circuit of length \(p\) for some odd prime \(p\) (a lobe of a graph is a subgraph induced by an equivalence class of edges with respect to the equivalence relation of lying on a common circuit). The paper contains a useful summary of the known results concerning vertex- or edge-transitive, planar, infinite graphs and the main result is obtained by a very nice combination of the known results and two interesting new theorems stating that any 1-ended, vertex- and edge-transitive, planar graph as well as any infinitely-ended, vertex- and edge-transitive, 3-connected, planar graph is imprimitive.