Jordan-like characterization of automorphism groups of planar graphs
DOI10.1016/j.jctb.2022.05.002zbMath1498.20006arXiv1506.06488OpenAlexW2611337411MaRDI QIDQ2674344
Pavel Klavík, Peter Zeman, Roman Nedela
Publication date: 23 September 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.06488
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph operations (line graphs, products, etc.) (05C76) Group actions on combinatorial structures (05E18)
Related Items (1)
Cites Work
- Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
- Geometry of surfaces
- Lifting graph automorphisms by voltage assignments
- Forestal algebras and algebraic forests (on a new class of weakly compact graphs)
- 3-connected reduction for regular graph covers
- Automorphismen von polyedrischen Graphen
- \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
- Automorphism Groups of Geometrically Represented Graphs
- On the Complexity of Covering Vertices by Faces in a Planar Graph
- A Combinatorial Decomposition Theory
- On-Line Planarity Testing
- Dividing a Graph into Triconnected Components
- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
- Enumeration of non-separable graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Jordan-like characterization of automorphism groups of planar graphs