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. Our result significantly improves the Babai's description (1975). |
Year | DOI | Venue |
---|---|---|
2022 | 10.1016/j.jctb.2022.05.002 | Journal of Combinatorial Theory, Series B |
Keywords | DocType | Volume |
Planar graph,Automorphism group,Spherical group,Wreath product,Graph isomorphism | Journal | 157 |
ISSN | Citations | PageRank |
0095-8956 | 0 | 0.34 |
References | Authors | |
0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Pavel Klavik | 1 | 0 | 0.34 |
Roman Nedela | 2 | 392 | 47.78 |
Peter Zeman | 3 | 0 | 0.34 |