Abstract
It is shown that the automorphism group of an infinite, locally finite, planar graph acts primitively on its vertex set if and only if the graph has connectivity 1 and, for some integer m≥2, every vertex is incident with exactly m lobes, all of which are finite. Specifically, either all of the lobes are isomorphic to K4 or all are circuits of length p for some odd prime p.
Original language | English (US) |
---|---|
Pages (from-to) | 87-104 |
Number of pages | 18 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 91 |
Issue number | 1 |
DOIs | |
State | Published - May 2004 |
Keywords
- Edge-transitive
- Infinite planar map
- Primitive permutation group
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics