Jordan-like characterization of automorphism groups of planar graphs
Combinatorics
2021-02-08 v5 Discrete Mathematics
Group Theory
Abstract
We investigate automorphism groups of planar graphs. The main result is a complete recursive description of all abstract groups that can be realized as automorphism groups of planar graphs. The characterization is formulated in terms of inhomogeneous wreath products. In the proof, we combine techniques from combinatorics, group theory, and geometry. This significantly improves the Babai's description (1975).
Keywords
Cite
@article{arxiv.1506.06488,
title = {Jordan-like characterization of automorphism groups of planar graphs},
author = {Pavel Klavík and Roman Nedela and Peter Zeman},
journal= {arXiv preprint arXiv:1506.06488},
year = {2021}
}
Comments
Some citations were added