2 citations · 2 across the 3 of their papers we have counts for
9 papers
On a representation of the automorphism group of a graph in a unimodular group
István Estelyi, Ján Karabáš, Alexander Mednykh +1
We investigate a representation of the automorphism group of a connected graph in the group of unimodular matrices of dimension , where is the Betti number of grap…
Automorphism groups of maps in linear time
Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela +1
By a map we mean a -cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can…
The Weisfeiler-Leman dimension of distance-hereditary graphs
Alexander L. Gavrilyuk, Roman Nedela, Ilia Ponomarenko
A graph is said to be distance-hereditary if the distance function in every connected induced subgraph is the same as in the graph itself. We prove that the ordinary Weisfeiler-Lem…
Testing isomorphism of circular-arc graphs in polynomial time
Roman Nedela, Ilia Ponomarenko, Peter Zeman
A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is pr…
Complete regular dessins and skew-morphisms of cyclic groups
Yan-Quan Feng, Kan Hu, Roman Nedela +2
A dessin is a 2-cell embedding of a connected -coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of orientation- and colour-preserving…
Regular dessins uniquely determined by a nilpotent automorphism group
Naer Wang, Roman Nedela, Kan Hu
It is well known that the automorphism group of a regular dessin is a two-generator finite group, and the isomorphism classes of regular dessins with automorphism groups isomorphic…