11 citations · 23 across the 21 of their papers we have counts for
4 papers · 1 filter
Totally symmetric dessins with nilpotent automorphism groups of class three
Na-Er Wang, Roman Nedela, Kan Hu
A dessin is a 2-cell embedding of a connected bipartite graph into an orientable closed surface. An automorphism of a dessin is a permutation of the edges of the underlying graph w…
Nilpotent dessins: Decomposition theorem and classification of the abelian dessins
Kan Hu, Roman Nedela, Na-Er Wang
A map is a 2-cell decomposition of an orientable closed surface. A dessin is a bipartite map with a fixed colouring of vertices. A dessin is regular if its group of colour- and ori…
Jordan-like characterization of automorphism groups of planar graphs
Pavel Klavík, Roman Nedela, Peter Zeman
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 plana…
3-connected Reduction for Regular Graph Covers
Jiří Fiala, Pavel Klavík, Jan Kratochvíl +1
A graph covers a graph if there exists a locally bijective homomorphism from to . We deal with regular coverings in which this homomorphism is prescribed by an actio…